A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times

References

• Adams , J. , Balas , E. and Zawack , D. 1988 . The shifting bottleneck procedure for job shop scheduling . Management Science , 3 : 391 – 401 .
   Google Scholar
• Ahn , S. H. 1995 . A study on algorithm to minimize makespan of sequence-dependent jobs . Journal of the Korean Institute of Management Science , 12 : 77 – 87 .
   Google Scholar
• Artigues , C. , Belmokhtar , S. and Fillet , D. 2004 . A new exact solution algorithm for the job shop problem with sequence-dependent setup times . Lecture Notes in Computer Science , 3011 : 37 – 49 .
   Google Scholar
• Artigues , C. and Roubellat , F. 2002 . An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times . Production Planning and Control , 13 : 175 – 186 .
   Web of Science ®Google Scholar
• Baker , K. R. 1974 . “ Introduction to sequencing and schecduling ” . New York : John Wiley .
   Google Scholar
• Balas , E. 1969 . Machine sequencing via disjunctive graphs: An implicit enumeration approach . Operations Research , 17 : 941 – 957 .
   Web of Science ®Google Scholar
• Balas , E. , Lenstra , J. K. and Vazacopoulos , E. 1995 . The one machine problem with delayed precedence constraints and its use in job shop scheduling . Management Science , 41 : 94 – 109 .
   Web of Science ®Google Scholar
• Bianco , L. , Dell'olmo , P. and Giordani , S. 1999 . Flow shop no-wait scheduling with sequence-dependent set-up times and release dates . INFOR Journal , 37 : 3 – 11 .
   Web of Science ®Google Scholar
• Chen , C. L. , Vempati , V. S. and Aljaber , N. 1995 . An application of genetic algorithms for flow shop problems . European Journal of Operations Research , 80 : 389 – 396 .
   Web of Science ®Google Scholar
• Cheng , R. , Gen , M. and Tsujimura , Y. 1996 . A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: Representation . Computers and Industrial Engineering , 30 : 983 – 1996 .
   Web of Science ®Google Scholar
• Cheng , R. , Gen , M. and Tsujimura , Y. 1999 . A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies . Computers and Industrial Engineering , 36 : 343 – 364 .
   Web of Science ®Google Scholar
• Cheung , W. and Zhou , H. 2001 . Using genetic algorithm and heuristic for job shop scheduling with sequence-dependent setup times . Annals of Operations Research , 107 : 65 – 81 .
   Web of Science ®Google Scholar
• Choi , I. and Choi , D. 2002 . A local search algorithm for job shop scheduling problems with alternative operations and sequence-dependent setups . Computers and Industrial Engineering , 42 : 43 – 58 .
   Web of Science ®Google Scholar
• Flynn , B. B. 1987 . Repetitive lots: The use of a sequence-dependent set-up time scheduling procedure in group technology and traditional shops . Journal of Operations Management , 7 : 203 – 216 .
   Google Scholar
• Goldberg , D. E. 1989 . Genetic algorithms in search, optimization and machine learning , Massacheusetts : Addison Wesley .
   Google Scholar
• Gupta , J. N.D. 2002 . An excursion in scheduling theory: an overview of scheduling research in the twentieth century . Production Planning and Control , 13 : 105 – 116 .
   Web of Science ®Google Scholar
• Gupta , J. N.D. 1986 . The two machine sequence-dependent flow shop scheduling problem . European Journal of Operations Research , 24 : 439 – 446 .
   Web of Science ®Google Scholar
• Gupta , S. K. 1982 . N jobs and m machines job-shop problems with sequence-dependent setup times . International Journal of Production Research , 20 : 643 – 656 .
   Web of Science ®Google Scholar
• Gupta , M. , Gupta , Y. and Kumar , A. 1993 . Minimizing flow time variance in single machine system using genetic algorithms . European Journal of Operations Research , 70 : 289 – 303 .
   Web of Science ®Google Scholar
• Holland , J. 1975 . Adaptation in natural and artificial systems , Ann Arbor : University of Michigan Press .
   Google Scholar
• Hsieh , C. , Chou , J. and Wu , Y. Taguchi–MHGA method for optimizing grey-fuzzy gain-scheduler . Proceedings of the 6th International Conference on Automation Technology . pp. 575 – 582 .
   Google Scholar
• Hwang , H. and Sun , J. U. 1998 . Production sequencing problem with re-entrant work flows and sequence-dependent setup times . International Journal of Production Research , 36 : 2435 – 2450 .
   Web of Science ®Google Scholar
• Karg , L. L. and Thompson , G. L. 1964 . A heuristic approach to the traveling salesman . Management Science , 11 : 225 – 248 .
   Google Scholar
• Kim , S. C. and Bobrowski , P. M. 1994 . Impact of sequence-dependent setup time on job shop scheduling performance . International Journal of Production Research , 32 : 1503 – 1520 .
   Web of Science ®Google Scholar
• Koonce , D. A. and Tsai , S. C. 2000 . Using data mining to find patterns in genetic algorithm solutions to a job shop schedule . Computers and Industrial Engineering , 38 : 361 – 374 .
   Web of Science ®Google Scholar
• Lee , C. Y. and Choi , J. Y. 1995 . A genetic algorithm for job sequencing problems with distinct due dates and general early–tardy penalty weights . Computers and Operations Research, , 22 : 857 – 869 .
   Web of Science ®Google Scholar
• Leung , Y. and Wang , Y. 2001 . An orthogonal genetic algorithm with quantization for global numerical optimization . IEEE Transactions on Evolutionary Computation , 5 : 41 – 53 .
   Web of Science ®Google Scholar
• Liu , T. , Tasi , J. and Chou , J. 2006 . Improved genetic algorithm for the job-shop scheduling problem . International Journal of Advanced Manufacturing Technology , 27 : 1021 – 1029 .
   Web of Science ®Google Scholar
• Norman , B. A. 1999 . Scheduling flowshops with finite buffers and sequence-dependent setup times . Computers and Industrial Engineering , 36 : 163 – 177 .
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1995 . Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times . International Journal of Production Research , 33 : 3173 – 3192 .
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1997 . Decomposition methods for complex factory scheduling problems , Norwell, MA : Kluwer Academic .
   Google Scholar
• Pakath , R. and Zaveri , J. S. 1993 . Specifying critical inputs in a genetic-driven decision support system: An automated facility , Lexington, , USA : University of Kentucky . Working paper
   Google Scholar
• Pan , J. C. and Chen , J. 2005 . Mixed binary integer programming formulations for the reentrant job shop scheduling problem . Computers & Operations Research , 32 : 1197 – 1212 .
   Web of Science ®Google Scholar
• Phadke , M. S. 1989 . Quality engineering using robust design , Englewood Cliffs, NJ : Prentice–Hall International .
   Google Scholar
• Radhakrishnan , S. and Ventura , J. A. 2000 . Simulated annealing for parallel machine scheduling with earliness–tardiness penalties and sequence-dependent set-up times . International Journal of Production Research , 38 : 2233 – 2252 .
   Web of Science ®Google Scholar
• Schaffer , J. D. , Caruana , R. A. , Eshelman , L. J. and Das , R. A study of control parameter affecting online performance of genetic algorithms for function optimization . Proceedings of the 3rd International Conference on Genetic Algorithms . pp. 98 – 103 . Arlington, VA
   Google Scholar
• Sun , J. U. and Hwang , H. 2001 . Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times . International Journal of Systems Science , 32 : 375 – 385 .
   Web of Science ®Google Scholar
• Uzsoy , R. and Wang , C. S. 2000 . Performance of decomposition procedures for job shop scheduling problems with bottleneck machines . International Journal of Production Research , 38 : 1271 – 1286 .
   Web of Science ®Google Scholar
• Wilbrecht , J. K. and Prescott , E. 1969 . The influence of set-up time on job shop performance . Management Science , 16 : 274 – 280 .
   Web of Science ®Google Scholar
• Zhu , X. and Wilhelm , W. 2006 . Scheduling and lot sizing with sequence-dependent setup: A literature review . IIE Transactions , 38 : 987 – 1007 .
   Web of Science ®Google Scholar
• Zoghby , J. , Barnes , J. W. and Hasenbein , J. J. 2005 . Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches . European Journal of Operational Research , 167 : 336 – 348 .
   Web of Science ®Google Scholar