Hybrid greedy algorithms for fuzzy tardiness/earliness minimisation in a special single machine scheduling problem: case study and generalisation

References

• Al-Aomar, R., and A. Al-Okaily. 2006. “A GA-Based Parameter Design for Single Machine Turning Process with High-Volume Production.” Computers & Industrial Engineering 50: 317–337. doi:10.1016/j.cie.2006.02.003.
   Web of Science ®Google Scholar
• Allahverdi, A., C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187: 985–1032. doi:10.1016/j.ejor.2006.06.060.
   Web of Science ®Google Scholar
• Allaoua, H., and I. Osmane. 2010. “Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling with a Common Due Date.” Electronic Notes in Discrete Mathematics 36: 471–478. doi:10.1016/j.endm.2010.05.060.
   Google Scholar
• Arkat, J., and H. Ghahve. 2014. “Scheduling of Virtual Manufacturing Cells with Outsourcing Allowed.” International Journal of Computer Integrated Manufacturing 27 (12): 1079–1089. doi:10.1080/0951192X.2013.874581.
   Web of Science ®Google Scholar
• Baker, K., and G. D. Scudder. 1990. “Sequencing with Earliness and Tardiness Penalties: A Review.” Operations Research 38: 22–36. doi:10.1287/opre.38.1.22.
   Web of Science ®Google Scholar
• Baptiste, P., and C. Le Pape. 2005. “Scheduling a Single Machine to Minimize a Regular Objective Function under Setup Constraints.” Discrete Optimization 2: 83–99. doi:10.1016/j.disopt.2004.12.003.
   Google Scholar
• Behnamian, J. 2014. “Multi-Cut Benders Decomposition Approach to Collaborative Scheduling.” International Journal of Computer Integrated Manufacturing 1–11. doi:10.1080/0951192X.2014.961963.
   Google Scholar
• Bellman, R., and L. Zadeh. 1970. “Decision-Making in a Fuzzy Environment.” Management Science 17: 141–164. doi:10.1287/mnsc.17.4.B141.
   Web of Science ®Google Scholar
• Burke, E. K., J. Li, and R. Qu. 2010. “A Hybrid Model of Integer Programming and Variable Neighbourhood Search for Highly-Constrained Nurse Rostering Problems.” European Journal of Operational Research 203: 484–493. doi:10.1016/j.ejor.2009.07.036.
   Web of Science ®Google Scholar
• Cheng, T. C. E., and M. Y. Kovalyov. 2001. “Single Machine Batch Scheduling with Sequential Job Processing.” IIE Transactions 33: 413–420. doi:10.1080/07408170108936839.
   Web of Science ®Google Scholar
• Chiang, T. C., and L. C. Fu. 2007. “Using Dispatching Rules for Job Shop Scheduling with Due Date-Based Objectives.” International Journal of Production Research 45 (14): 3245–3262. doi:10.1080/00207540600786715.
   Web of Science ®Google Scholar
• Chryssolouris, G. 2006. Manufacturing Systems: Theory and Practice. 2nd ed. New York, NY: Springer.
   Google Scholar
• Chryssolouris, G., K. Dicke, and M. Lee. 1991. “An Approach to Short Interval Scheduling for Discrete Parts Manufacturing.” International Journal of Computer Integrated Manufacturing 4 (3): 157–168. doi:10.1080/09511929108944491.
   Web of Science ®Google Scholar
• Chryssolouris, G., K. Dicke, and M. Lee. 1994. “An Approach to Real-Time Flexible Scheduling.” International Journal of Flexible Manufacturing Systems 6 (3): 235–253. doi:10.1007/BF01328813.
   Google Scholar
• Damodaran, P., P. K. Manjeshwar, and K. Srihari. 2006. “Minimizing Makespan on a Batch Processing Machine with Non-Identical Job Sizes Using Genetic Algorithms.” International Journal of Production Economics 103: 882–891. doi:10.1016/j.ijpe.2006.02.010.
   Web of Science ®Google Scholar
• Dang, C., and L. Kang. 2004. “Batch-Processing Scheduling with Setup Times.” Journal of Combinatorial Optimization 8: 137–146. doi:10.1023/B:JOCO.0000031415.55216.2a.
   Web of Science ®Google Scholar
• Driessel, R., and L. Mönch. 2011. “Variable Neighborhood Search Approaches for Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times, Precedence Constraints, and Ready Times.” Computers & Industrial Engineering 61: 336–345. doi:10.1016/j.cie.2010.07.001.
   Web of Science ®Google Scholar
• Eiben, A., and J. Smith. 2003. Introduction to Evolutionary Computing. Berlin: Springer-Verlag.
   Google Scholar
• Elmi, A., and S. Topaloglu. 2014. “Scheduling Multiple Parts in Hybrid Flow Shop Robotic Cells Served by a Single Robot.” International Journal of Computer Integrated Manufacturing 27 (12): 1144–1159. doi:10.1080/0951192X.2013.874576.
   Web of Science ®Google Scholar
• Garcia-Hernandez, L., H. Pierreval, L. Salas-Morera, and A. Arauzo-Azofra. 2013. “Handling Qualitative Aspects in Unequal Area Facility Layout Problem: An Interactive Genetic Algorithm.” Applied Soft Computing 13: 1718–1727. doi:10.1016/j.asoc.2013.01.003.
   Web of Science ®Google Scholar
• Gen, M., and R. Cheng. 1997. Genetic Algorithms and Engineering Design. New York, NY: Wiley.
   Google Scholar
• Gen, M., and R. Cheng. 2000. Genetic Algorithms and Engineering Optimization. New York, NY: Wiley.
   Google Scholar
• Gerodimos, A. E., C. A. Glass, and C. N. Potts. 2001. “Scheduling of Customized Jobs on a Single Machine under Item Availability.” IIE Transactions 33: 975–984. doi:10.1080/07408170108936888.
   Web of Science ®Google Scholar
• Hall, N. G., W. Kubiak, and S. P. Sethi. 1991. “Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times about a Restrictive Common Due Date.” Operations Research 39: 847–856. doi:10.1287/opre.39.5.847.
   Web of Science ®Google Scholar
• Hall, N. G., and M. E. Posner. 1991. “Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times about a Common Due Date.” Operations Research 39: 836–846. doi:10.1287/opre.39.5.836.
   Web of Science ®Google Scholar
• Hsu, C. 2013. “Application of SVR, Taguchi Loss Function, and the Artificial Bee Colony Algorithm to Resolve Multiresponse Parameter Design Problems: A Case Study on Optimizing the Design of A TIR Lens.” Neural Computing and Applications. doi:10.1007/s00521-013-1357-3.
   Web of Science ®Google Scholar
• Husseinzadeh Kashan, A., B. Karimi, and F. Jolai. 2006. “Effective Hybrid Genetic Algorithm for Minimizing Makespan on a Single-Batch-Processing Machine with Nonidentical Job Sizes.” International Journal of Production Research 44: 2337–2360. doi:10.1080/00207540500525254.
   Web of Science ®Google Scholar
• Jong, W. R., and P. J. Lai. 2014. “The Navigation Process of Mould-Manufacturing Scheduling Optimisation by Applying Genetic Algorithm.” International Journal of Computer Integrated Manufacturing. doi:10.1080/0951192X.2014.972461.
   Web of Science ®Google Scholar
• Karabatı, S., and C. Akkan. 2006. “Minimizing Sum of Completion Times on a Single Machine with Sequence-Dependent Family Setup Times.” Journal of the Operational Research Society 57: 271–280. doi:10.1057/palgrave.jors.2601989.
   Web of Science ®Google Scholar
• Kayvanfar, V., I. Mahdavi, and G. M. Komaki. 2013. “Single Machine Scheduling with Controllable Processing Times to Minimize Total Tardiness and Earliness.” Computers & Industrial Engineering 65: 166–175. doi:10.1016/j.cie.2011.08.019.
   Web of Science ®Google Scholar
• Kim, S. J., K. S. Kim, and H. Jang. 2003. “Optimization of Manufacturing Parameters for a Brake Lining Using Taguchi Method.” Journal of Materials Processing Technology 136: 202–208. doi:10.1016/S0924-0136(03)00159-6.
   Web of Science ®Google Scholar
• Kirkpatrick, S., C. D. Gelatt Jr., and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220: 671–680. doi:10.1126/science.220.4598.671.
   PubMed Web of Science ®Google Scholar
• Kirlik, G., and C. Oguz. 2012. “A Variable Neighborhood Search for Minimizing Total Weighted Tardiness with Sequence Dependent Setup Times on A Single Machine.” Computers & Operations Research 39: 1506–1520. doi:10.1016/j.cor.2011.08.022.
   Web of Science ®Google Scholar
• Kolahan, F., and M. Liang. 1998. “An Adaptive TS Approach to JIT Sequencing with Variable Processing Times and Sequence Dependent Setups.” European Journal of Operational Research 109: 142–159. doi:10.1016/S0377-2217(97)00098-2.
   Web of Science ®Google Scholar
• Liang, X., H. Chen, and R. Xu. 2014. “Approximately Optimal Algorithms for Scheduling a Single Machine with General Convex Resource Functions.” International Journal of Computer Integrated Manufacturing. doi:10.1080/0951192X.2014.934293.
   Web of Science ®Google Scholar
• Liu, C.-H. 2014. “Approximate Trade-Off between Minimisation of Total Weighted Tardiness and Minimisation of Carbon Dioxide (CO2) Emissions in Bi-Criteria Batch Scheduling Problem.” International Journal of Computer Integrated Manufacturing 27 (8): 759–771. doi:10.1080/0951192X.2013.834479.
   Web of Science ®Google Scholar
• Liu, L., and H. Zhou. 2013. “Hybridization of Harmony Search with Variable Neighborhood Search for Restrictive Single-Machine Earliness/Tardiness Problem.” Information Sciences 226: 68–92. doi:10.1016/j.ins.2012.11.007.
   Web of Science ®Google Scholar
• M’Halla, R. 2007. “Minimizing Total Earliness and Tardiness on a Single Machine Using a Hybrid Heuristic.” Computers & Operations Research 34: 3126–3142. doi:10.1016/j.cor.2005.11.021.
   Web of Science ®Google Scholar
• Mahmoodi-Rad, A., S. Molla-Alizadeh-Zavardehi, R. Dehghan, M. Sanei, and S. Niroomand. 2014. “Genetic and Differential Evolution Algorithms for the Allocation of Customers to Potential Distribution Centers in a Fuzzy Environment.” The International Journal of Advanced Manufacturing Technology 70: 1939–1954. doi:10.1007/s00170-013-5383-1.
   Web of Science ®Google Scholar
• Mashkani, O., and G. Moslehi. 2015. “Minimising the Total Completion Time in a Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability Constraints.” International Journal of Computer Integrated Manufacturing 1–19. doi:10.1080/0951192X.2014.1003413.
   Web of Science ®Google Scholar
• Mathirajan, M., V. Bhargav, and V. Ramachandran. 2010. “Minimizing Total Weighted Tardiness on a Batch-Processing Machine with Non-Agreeable Release Times and Due Dates.” The International Journal of Advanced Manufacturing Technology 48: 1133–1148. doi:10.1007/s00170-009-2342-y.
   Web of Science ®Google Scholar
• Mohapatra, P., N. Kumar, A. Matta, and M. K. Tiwari. 2014. “A Nested Partitioning-Based Approach to Integrate Process Planning and Scheduling in Flexible Manufacturing Environment.” International Journal of Computer Integrated Manufacturing 1–15. doi:10.1080/0951192X.2014.961548.
   Web of Science ®Google Scholar
• Molla-Alizadeh-Zavardehi, S., M. Hajiaghaei-Keshteli, and R. Tavakkoli-Moghaddam. 2011. “Solving a Capacitated Fixed-Charge Transportation Problem by Artificial Immune and Genetic Algorithms with a Prüfer Number Representation.” Expert Systems with Applications 38: 10462–10474. doi:10.1016/j.eswa.2011.02.093.
   Web of Science ®Google Scholar
• Naderi, B., M. Zandieh, A. K. Ghoshe Balagh, and V. Roshanaei. 2009. “An Improved Simulated Annealing for Hybrid Flow Shops with Sequence-Dependent Setup and Transportation Times to Minimize Total Completion Time and Total Tardiness.” Expert Systems with Applications 36: 9625–9633. doi:10.1016/j.eswa.2008.09.063.
   Web of Science ®Google Scholar
• Niroomand, S., and B. Vizvari. 2015. “Exact Mathematical Formulations and Metaheuristic Algorithms for Production Cost Minimization: A Case Study of the Cable Industry.” International Transactions in Operational Research 22: 519–544. doi:10.1111/itor.12096.
   Web of Science ®Google Scholar
• Papakostas, N., and G. Chryssolouris. 2009. “A Scheduling Policy for Improving Tardiness Performance.” Asian International Journal of Science and Technology 2 (3): 79–89.
   Google Scholar
• Phadke, M. S. 1989. Quality Engineering Using Robust Design. Englewood Cliffs: Prentice-Hall.
   Google Scholar
• Renna, P. 2014. “Deteriorating Job Scheduling Problem in a Job-Shop Manufacturing System by Multi-Agent System.” International Journal of Computer Integrated Manufacturing. doi:10.1080/0951192X.2014.928747.
   Google Scholar
• Schaller, J. 2007a. “A Comparison of Lower Bounds for the Single-Machine Early/Tardy Problem.” Computers & Operations Research 34: 2279–2292. doi:10.1016/j.cor.2005.09.003.
   Web of Science ®Google Scholar
• Schaller, J. 2007b. “Scheduling on a Single Machine with Family Setups to Minimize Total Tardiness.” International Journal of Production Economics 105: 329–344. doi:10.1016/j.ijpe.2004.10.020.
   Web of Science ®Google Scholar
• Schaller, J., and J. N. D. Gupta. 2008. “Single Machine Scheduling with Family Setups to Minimize Total Earliness and Tardiness.” European Journal of Operational Research 187: 1050–1068. doi:10.1016/j.ejor.2006.06.061.
   Web of Science ®Google Scholar
• Solimanpur, M., and A. Elmi. 2011. “A Tabu Search Approach for Group Scheduling in Buffer-Constrained Flow Shop Cells.” International Journal of Computer Integrated Manufacturing 24 (3): 257–268. doi:10.1080/0951192X.2011.552527.
   Web of Science ®Google Scholar
• Sourd, F. 2005. “Earliness–Tardiness Scheduling with Setup Considerations.” Computers & Operations Research 32: 1849–1865. doi:10.1016/j.cor.2003.12.002.
   Web of Science ®Google Scholar
• Sourd, F. 2006. “Dynasearch for the Earliness–Tardiness Scheduling Problem with Release Dates and Setup Constraints.” Operations Research Letters 34: 591–598. doi:10.1016/j.orl.2005.06.005.
   Web of Science ®Google Scholar
• Suriyaarachchi, R. H., and A. Wirth. 2004. “Earliness/Tardiness Scheduling with a Common Due Date and Family Setups.” Computers & Industrial Engineering 47: 275–288. doi:10.1016/j.cie.2004.07.006.
   Web of Science ®Google Scholar
• Taguchi, G. 1986. Introduction to Quality Engineering. White Plains: Asian Productivity Organization/UNIPUB.
   Google Scholar
• Talbi, E. G. 2009. Metaheuristics: From Design to Implementation. New York, NY: John Wiley & Sons.
   Google Scholar
• Tavakkoli-Moghaddam, R., A. Rahimi-Vahed, and A. H. Mirzaei. 2007. “A Hybrid Multi-Objective Immune Algorithm for a Flow Shop Scheduling Problem with Bi-Objectives: Weighted Mean Completion Time and Weighted Mean Tardiness.” Information Sciences 177: 5072–5090. doi:10.1016/j.ins.2007.06.001.
   Web of Science ®Google Scholar
• Tayebi Araghi, M. E., F. Jolai, and M. Rabiee. 2014. “Incorporating Learning Effect and Deterioration for Solving a SDST Flexible Job-Shop Scheduling Problem with a Hybrid Meta-Heuristic Approach.” International Journal of Computer Integrated Manufacturing 27 (8): 733–746. doi:10.1080/0951192X.2013.834465.
   Web of Science ®Google Scholar
• Tsai, J.-T., W.-H. Ho, T.-K. Liu, and J.-H. Chou. 2007. “Improved Immune Algorithm for Global Numerical Optimization and Job Shop Scheduling Problems.” Applied Mathematics and Computation 194: 406–424. doi:10.1016/j.amc.2007.04.038.
   Web of Science ®Google Scholar
• Wan, L., and J. Yuan. 2013. “Single-Machine Scheduling to Minimize the Total Earliness and Tardiness Is Strongly NP-Hard.” Operations Research Letters 41: 363–365. doi:10.1016/j.orl.2013.04.007.
   Web of Science ®Google Scholar
• Wang, S.-Y., L. Wang, M. Liua, and Y. Xua. 2015. “An Order-Based Estimation of Distribution Algorithm for Stochastic Hybrid Flow-Shop Scheduling Problem.” International Journal of Computer Integrated Manufacturing 28 (3): 307–320. doi:10.1080/0951192X.2014.880803.
   Web of Science ®Google Scholar
• Wang, Z., and B. H. Zhou. 2014. “Bottleneck-Based Scheduling Method of Multi-Robot Cells with Residency Constraints.” International Journal of Computer Integrated Manufacturing. doi:10.1080/0951192X.2014.964322.
   Web of Science ®Google Scholar
• Yin, Y., W. H. Wu, T. C. E. Cheng, and C. C. Wu. 2014. “Single-Machine Scheduling with Time-Dependent and Position-Dependent Deteriorating Jobs.” International Journal of Computer Integrated Manufacturing. doi:10.1080/0951192X.2014.900872.
   Web of Science ®Google Scholar
• Zadeh, L. A. 1965. “Fuzzy Sets.” Information and Control 8: 338–353. doi:10.1016/S0019-9958(65)90241-X.
   Web of Science ®Google Scholar
• Zhao, F., J. Tang, J. Wang, and J. Jonrinaldi. 2014. “An Improved Particle Swarm Optimisation with a Linearly Decreasing Disturbance Term for Flow Shop Scheduling with Limited Buffers.” International Journal of Computer Integrated Manufacturing 27 (5): 488–499. doi:10.1080/0951192X.2013.814165.
   Web of Science ®Google Scholar