Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

References

• 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 (3): 985–1032. doi: 10.1016/j.ejor.2006.06.060
   Web of Science ®Google Scholar
• Artigues, C., S. Belmokhtar, and D. Feillet. 2004. “A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times.” Lecture Notes in Computer Science 3011: 37–49. doi: 10.1007/978-3-540-24664-0_3
   Google Scholar
• Artigues, C., and D. Feillet. 2008. “A Branch and Bound Method for the Job-Shop Problem with Sequence-Dependent Setup Times.” Annals of Operations Research 159 (1): 135–159. doi: 10.1007/s10479-007-0283-0
   Web of Science ®Google Scholar
• Artigues, C., P. Lopez, and P. D. Ayache. 2005. “Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis.” Annals of Operations Research 138 (1): 21–52. doi: 10.1007/s10479-005-2443-4
   Web of Science ®Google Scholar
• Artigues, C., and F. Roubellat. 2001. “A Petri Net Model and a General Method for On and Off-Line Multi-resource Shop Floor Scheduling with Setup Times.” International Journal of Production Economics 74 (1): 63–75. doi: 10.1016/S0925-5273(01)00107-4
   Web of Science ®Google Scholar
• Artigues, C., and F. Roubellat. 2002. “An Efficient Algorithm for Operation Insertion in a Multi-resource Job-Shop Schedule with Sequence-Dependent Setup Times.” Production Planning & Control 13 (2): 175–186. doi: 10.1080/09537280110069757
   Web of Science ®Google Scholar
• Baker, K. R. 1974. Introduction to Sequencing and Scheduling. New York: John Wiley & Sons.
   Google Scholar
• Balas, E., N. Simonetti, and A. Vazacopoulo. 2008. “Job Shop Scheduling with Setup Times, Deadlines and Precedence Constraints.” Journal of Scheduling 11 (4): 253–262. doi: 10.1007/s10951-008-0067-7
   Web of Science ®Google Scholar
• Bierwirth, C. 1995. “A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms.” Operations Research Spektrum 17 (2–3): 87–92. doi: 10.1007/BF01719250
   Google Scholar
• Brucker, P., and O. Thiele. 1996. “A Branch and Bound Method for the General-Shop Problem with Sequence Dependent Setup-Times.” Operations Research Spektrum 18 (3): 145–161. doi: 10.1007/BF01539706
   Google Scholar
• Cheung, W., and H. Zhou. 2001. “Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times.” Annals of Operations Research 107 (1–4): 65–81. doi: 10.1023/A:1014990729837
   Web of Science ®Google Scholar
• Chiang, T. C., and L. C. Fu. 2009. “Using a Family of Critical Ratio-Based Approaches to Minimize the Number of Tardy Jobs in the Job Shop with Sequence Dependent Setup Times.” European Journal of Operational Research 196 (1): 78–92. doi: 10.1016/j.ejor.2007.12.042
   Web of Science ®Google Scholar
• Choi, I. C., and D. S. Choi. 2002. “A Local Search Algorithm for Jobshop Scheduling Problems with Alternative Operations and Sequence-Dependent Setups.” Computers & Industrial Engineering 42 (1): 43–58. doi: 10.1016/S0360-8352(02)00002-5
   Web of Science ®Google Scholar
• Choi, I. C., and O. Korkmaz. 1997. “Job Shop Scheduling with Separable Sequence-Dependent Setups.” Annals of Operations Research 70 (1): 155–170. doi: 10.1023/A:1018918003761
   Web of Science ®Google Scholar
• Focacci, F., P. Laborie, and W. Nuijten. 2000. “Solving Scheduling Problems with Setup Times and Alternative Resources.” Proceedings of the fifth international conference on artificial intelligence planning and scheduling, Colorado: USA.
   Google Scholar
• González, M. A., C. Vela, and R. Varela. 2009. “Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times.” Lecture Notes in Computer Science 5601 (1): 265–274. doi: 10.1007/978-3-642-02264-7_28
   Google Scholar
• Guide, Jr., V. D. R. 2000. “Production Planning and Control for Remanufacturing: Industry Practice and Research Needs.” Journal of Operations Management 18 (4): 467–483. doi: 10.1016/S0272-6963(00)00034-6
   Web of Science ®Google Scholar
• Jain, A. S., and S. Meeran. 1999. “Deterministic Job-Shop Scheduling: Past, Present and Future.” European Journal of Operational Research 113 (2): 390–434. doi: 10.1016/S0377-2217(98)00113-1
   Web of Science ®Google Scholar
• Lenstra, J., A. H. G. Rinnooy Kan, and P. Brucker. 1977. “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1 (1): 343–362. doi: 10.1016/S0167-5060(08)70743-X
   Google Scholar
• Lin, S. W., C. C. Lu, and K. C. Ying. 2011. “Minimization of Total Tardiness on Unrelated Parallel Machines with Sequence- and Machine-Dependent Setup Times Under Due Date Constraints.” The International Journal of Advanced Manufacturing Technology 53 (1): 353–361. doi: 10.1007/s00170-010-2824-y
   Web of Science ®Google Scholar
• Lund, R. 1984. “Remanufacturing.” Technology Review 87 (2): 18–23.
   Web of Science ®Google Scholar
• Mongkalig, C., Tabucanon, M. T., and Hop, N. V. 2005. “Heuristics for Job Shop Scheduling Problems with Progressive Weighted Tardiness Penalties and Inter-machine Overlapping Sequence-Dependent Setup Times.” Industrial Engineering & Management Systems 4 (1): 1–22.
   Google Scholar
• Naderi, B., M. Zandieh, and S. M. T. Fatemi Ghomi. 2009. “Scheduling Job Shop Problems with Sequence-Dependent Setup Times.” International Journal of Production Research 47 (21): 5959–5976. doi: 10.1080/00207540802165817
   Web of Science ®Google Scholar
• Natarajan, K., K. M. Mohanasundaram, B. Shoban Babu, S. Suresh, K. Antony Arokia Durai Raj, and C. Rajendran. 2007. “Performance Evaluation of Priority Dispatching Rules in Multi-level Assembly Job Shops with Jobs Having Weights for Flowtime and Tardiness.” International Journal of Advanced Manufacturing Technology 31 (7): 751–761.
   Web of Science ®Google Scholar
• Nawaz, M., E. E. Enscore Jr., and I. Ham. 1983. “A Heuristic Algorithm for the M-Machine, N-Job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95. doi: 10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Nowicki, E., and C. Smutnicki. 1996. “A Fast Taboo Search Algorithm for the Job Shop Problem.” Management Science 42 (6): 797–813. doi: 10.1287/mnsc.42.6.797
   Web of Science ®Google Scholar
• Park, J.-H., and D.-H. Lee. 2012. “Job Shop Scheduling with Job Families and Sequence-Dependent Setups: Minimizing the Total Family Flow Time.” Proceedings of the Asia pacific industrial engineering and management systems conference, Phuket, Thailand.
   Google Scholar
• Reeja, M. K., and C. Rajendran. 2000a. “Dispatching Rules for Scheduling in Assembly Jobshops—Part 1.” International Journal of Production Research 38 (9): 2051–2066. doi: 10.1080/002075400188492
   Web of Science ®Google Scholar
• Reeja, M. K, and C. Rajendran. 2000b. “Dispatching Rules for Scheduling in Assembly Jobshops—Part 2.” International Journal of Production Research 38 (10): 2349–2360. doi: 10.1080/00207540050028133
   Web of Science ®Google Scholar
• Rodriguez, F. J., M. Lozano, C. Blum, and C. García-Martínez. 2013. “An Iterated Greedy Algorithm for the Large-Scale Unrelated Parallel Machines Scheduling Problem.” Computers & Operations Research 40 (1): 1829–1841. doi: 10.1016/j.cor.2013.01.018
   Web of Science ®Google Scholar
• Ruiz, R., and T. A. Stützle. 2007. “A Simple and Effective Iterated Greedy Algorithm for the Permutation Flowshop Scheduling Problem.” European Journal of Operational Research 177 (3): 2033–2049. doi: 10.1016/j.ejor.2005.12.009
   Web of Science ®Google Scholar
• Sharma, P., and A. Jain. 2016. “A Review on Job Shop Scheduling with Setup Times.” Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 230 (3): 517–533. doi: 10.1177/0954405414560617
   Web of Science ®Google Scholar
• Steinhilper, R. 1998. Remanufacturing: The Ultimate Form of Recycling. Stuttgart: Fraunhofer IRB Verlag.
   Google Scholar
• Sun, J. U. 2009. “A Genetic Algorithm for a Re-entrant Job-Shop Scheduling Problem with Sequence-Dependent Setup Times.” Engineering Optimization 41 (6): 505–520. doi: 10.1080/03052150802613335
   Web of Science ®Google Scholar
• Sun, X., and J. S. Noble. 1999. “An Approach to Job Shop Scheduling with Sequence-Dependent Setups.” Journal of Manufacturing Systems 18 (6): 416–430. doi: 10.1016/S0278-6125(00)87643-8
   Web of Science ®Google Scholar
• Taillard, E. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285. doi: 10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Tasgetiren, M. F., Q.-K. Pan, P. N. Suganthan, and O. Buyukdagli. 2013. “A Variable Iterated Greedy Algorithm with Differential Evolution for the No-Idle Permutation Flowshop Scheduling Problem.” Computers & Operations Research 40 (7): 1729–1743. doi: 10.1016/j.cor.2013.01.005
   Web of Science ®Google Scholar
• Yu, J.-M., J.-S. Kim, and D.-H. Lee. 2011. “Scheduling Algorithms to Minimise the Total Family Flow Time for Job Shops with Job Families.” International Journal of Production Research 49 (22): 6885–6903. doi: 10.1080/00207543.2010.507609
   Web of Science ®Google Scholar
• Zhou, C., and P. G. Egbelu. 1989. “Scheduling in a Manufacturing Shop with Sequence-Dependent Setups.” Robotics and Computer-Integrated Manufacturing 5 (1): 73–81. doi: 10.1016/0736-5845(89)90031-8
   Web of Science ®Google Scholar
• Zhou, Y., B. Li, and J. Yang. 2006. “Study on Job Shop Scheduling with Sequence-Dependent Setup Times Using Biological Immune Algorithm.” The International Journal of Advanced Manufacturing Technology 30 (1): 105–111. doi: 10.1007/s00170-005-0022-0
   Web of Science ®Google Scholar
• Zhu, X., and W. E. Wilhelm. 2006. “Scheduling and Lot Sizing with Sequence Dependent Setup: A Literature Review.” IIE Transactions 38 (1): 987–1007. doi: 10.1080/07408170600559706
   Web of Science ®Google Scholar
• Zoghby, J., J. W. Barnes, and J. J. Hasenbein. 2005. “Modeling the Reentrant Job Shop Scheduling Problem with Setups for Metaheuristic Searches.” European Journal of Operational Research 167 (2): 336–348. doi: 10.1016/j.ejor.2004.03.027
   Web of Science ®Google Scholar