Scheduling and lot sizing with sequence-dependent setup: A literature review

References

• Adams , J. , Balas , E. and Zawack , D. 1988 . The shifting bottleneck procedure for job shop scheduling . Management Science , 34 : 391 – 401 . [CSA]
   Web of Science ®Google Scholar
• Aldowaisan , T. and Allahverdi , A. 2003 . New heuristics for no-wait flow shops to minimize makespan . Computers & Operations Research , 30 : 1219 – 1231 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Alidaee , B. , Kochenberger , G. A. and Amini , M. M. 2001 . Greedy solutions of selection and ordering problems . European Journal of Operational Research , 134 : 203 – 215 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Allahverdi , A. , Gupta , J. N.D. and Aldowaisan , T. 1999 . A review of scheduling research involving setup considerations . Omega , 27 ( 2 ) : 219 – 239 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Anglani , A. , Grieco , A. , Guerriero , E. and Musmanno , R. 2005 . Robust scheduling of parallel machines with sequence-dependent set-up costs . European Journal of Operational Research , 161 : 704 – 720 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Artigues , C. and Roubellat , O. 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 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Arzi , Y. and Raviv , D. 1998 . Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times . Production Planning & Control , 9 ( 7 ) : 690 – 699 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Asano , M. and Ohta , H. 1996 . Single machine scheduling using dominance relation to minimize earliness subject to ready and due times . International Journal of Production Economics , 44 ( 1/2 ) : 35 – 43 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Asano , M. and Ohta , H. 1999 . Scheduling with shutdowns and sequence dependent setup times . International Journal of Production Research , 37 ( 7 ) : 1661 – 1676 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Aytug , H. , Lawley , M. A. , McKay , K. , Mohan , S. and Uzsoy , R. 2005 . Executing production schedules in the face of uncertainties: a review and some future directions . European Journal of Operational Research , 161 : 86 – 110 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Balakrishnan , N. , Kanet , J. J. and Sridharan , S. V. 1999 . Early/tardy scheduling with sequence dependent setups on uniform parallel machines . Computers & Operations Research , 26 ( 2 ) : 127 – 141 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Balas , E. 1969 . Machine sequencing via disjunctive graphs: an implicit enumeration approach . Operations Research , 17 : 941 – 957 . [CSA]
   Web of Science ®Google Scholar
• Barnes , J. W. and Vanston , L. K. 1981 . Scheduling jobs with linear delay penalties and sequence dependent setup costs . Operations Research , 29 : 146 – 154 . [CSA]
   Web of Science ®Google Scholar
• Bianco , L. , Dell'Olmo , P. and Giordani , S. 1999 . Flowshop no-wait scheduling with sequence-dependent setup times and release dates . INFOR , 37 ( 1 ) : 3 – 19 . [CSA]
   Web of Science ®Google Scholar
• Bilge , U. , Klrac , F. , Kurtulan , M. and Pekgü , P. 2004 . A tabu search algorithm for parallel machine total tardiness problem . Computers & Operations Research , 31 ( 3 ) : 397 – 414 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Bitran , G. R. and Gilbert , S. M. 1990 . Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost . Journal of Manufacturing Operations Management , 3 : 24 – 52 . [CSA]
   Google Scholar
• Blocher , J. D. , Chand , S. and Sengupta , K. 1999 . The changeover scheduling problem with time and cost considerations: analytical results and a forward algorithm . Operations Research , 47 ( 4 ) : 559 – 569 . [CSA]
   Web of Science ®Google Scholar
• Candido , M. A.B. , Khator , S. K. and Barcia , R. M. 1998 . A genetic algorithm based procedure for more realistic job shop scheduling problems . International Journal of Production Research , 36 ( 12 ) : 3437 – 3457 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Cattrysse , D. , Salomon , M. , Kuik , R. and Van Wassenhove , L. N. 1993 . A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times . Management Science , 39 ( 4 ) : 477 – 486 . [CSA]
   Web of Science ®Google Scholar
• Chen , Z.-L. 1997 . Scheduling with batch setup times and earliness-tardiness penalties . European Journal of Operational Research , 96 : 518 – 537 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Cheng , T. C.E. and Chen , Z.-L. 1994 . Parallel machine scheduling with batch setup times . Operations Research , 42 ( 6 ) : 1171 – 1174 . [CSA]
   Web of Science ®Google Scholar
• Cheng , T. C.E. , Gupta , J. N.D. and Wang , G. 2000 . A review of flowshop scheduling with setup times . Production and Operations Management , 9 ( 3 ) : 262 – 282 . [CSA]
   Web of Science ®Google Scholar
• Cheung , W. and Zhou , H. 2002 . Using generic algorithms and heuristics for job shop scheduling with sequence-dependent setup times . Annals of Operations Research , 107 : 65 – 81 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Choi , I. and Choi , D. 2002 . A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups . Computers & Industrial Engineering , 42 ( 1 ) : 43 – 58 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Choi , I. , Kim , S. and Kim , H. 2003 . A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem . Computers & Operations Research , 30 ( 5 ) : 773 – 786 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Choi , I. C. and Korkmaz , O. 1997 . Job shop scheduling with sequence-dependent setups . Annals of Operations Research , 70 : 155 – 170 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Coffman , E. G. Jr. , Garey , M. R. and Johnson , D. S. 1978 . An application of bin-packing to multiprocessor scheduling . SIAM Journal on Computing , 7 : 1 – 17 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Coleman , J. B. 1992 . A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups . Production and Operations Management , 1 ( 2 ) : 225 – 228 . [CSA]
   Google Scholar
• Das , S. R. , Gupta , J. N.D. and Khumawala , B. M. 1995 . A saving index heuristic algorithm for flowshop scheduling with sequence-dependent setup times . Journal of the Operational Research Society , 46 : 1365 – 1373 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Dastidar , G. S. and Nagi , R. 2005 . Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs . Computers & Operations Research , 32 : 2987 – 3005 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Delporte , C. M. and Thomas , L. J. 1977 . Lot sizing and sequencing for N products on one facility . Management Science , 23 ( 10 ) : 1070 – 1079 . [CSA]
   Web of Science ®Google Scholar
• Demirkol , E. and Uzsoy , R. 2000 . Decomposition methods for reentrant flow shops with sequence-dependent setup times . Journal of Scheduling , 3 ( 3 ) : 155 – 177 . [CROSSREF] [CSA]
   Google Scholar
• Dhaenens-Flipo , C. 2001 . A bicriterion approach to deal with a constrained single-objective problem . International Journal of Production Economics , 74 : 93 – 101 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Dobson , G. 1992 . The cyclic lot scheduling problem with sequence-dependent setups . Operations Research , 40 ( 4 ) : 736 – 749 . [CSA]
   Web of Science ®Google Scholar
• Dobson , G. , Karmarkar , U. S. and Rummel , J. L. 1987 . Batching to minimize flow times on one machine . Management Science , 33 : 784 – 799 . [CSA]
   Web of Science ®Google Scholar
• Drexl , A. and Kimms , A. 1997 . Lot sizing and scheduling—survey and extensions . European Journal of Operational Research , 99 : 221 – 235 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Feo , T. A. , Bard , J. F. and Holland , S. D. 1995 . Facility-wide planning and scheduling of printed wiring board assembly . Operations Research , 43 ( 2 ) : 219 – 230 . [CSA]
   Web of Science ®Google Scholar
• Feo , T. A. , Sarathy , K. and McGahan , J. 1996 . A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties . Computers & Operations Research , 23 ( 9 ) : 881 – 895 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Fleischmann , B. 1990 . The discrete lot-sizing and scheduling problem . European Journal of Operations Research , 44 : 337 – 348 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Fleischmann , B. 1994 . The discrete lot-sizing and scheduling problem with sequence-dependent setup costs . European Journal of Operational Research , 75 ( 2 ) : 395 – 404 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Fleischmann , B. and Meyr , H. 1997 . The general lotsizing and scheduling problem . OR Spektrum , 19 ( 1 ) : 11 – 21 . [CSA]
   Google Scholar
• França , P. M. , Gendreau , M. , Laporte , G. and Muller , F. M. 1996 . A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times . International Journal of Production Economics , 43 ( 2/3 ) : 79 – 89 . [CSA]
   Web of Science ®Google Scholar
• França , P. M. , Gupta , J. N.D. , Mendes , A. S. , Moscato , P. and Veltink , K. J. 2005 . Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups . Computers & Industrial Engineering , 48 : 491 – 506 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• França , P. M. , Mendes , A. and Moscato , P. 2001 . A memetic algorithm for the total tardiness single machine scheduling problem . European Journal of Operational Research , 132 : 224 – 242 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Gendreau , M. , Laporte , G. and Guimarces , E. M. 2001 . A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times . European Journal of Operational Research , 133 ( 1 ) : 183 – 189 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Ghosh , J. B. 1994 . Batch scheduling to minimize total completion time . Operations Research Letters , 16 : 271 – 275 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Glover , F. 1989 . Tabu search—Part I . ORSA Journal on Computing , 1 : 190 – 206 . [CSA]
   Google Scholar
• Glover , F. 1990 . Tabu search—Part II . ORSA Journal on Computing , 2 : 40 – 42 . [CSA]
   Google Scholar
• Graham , R. L. , Lawler , E. L. , Lenstra , J. K. and Rinnooy Kan , A. H.G. 1979 . Optimization and approximation in deterministic sequencing and scheduling: a survey . Annals of Discrete Mathematics , 5 : 287 – 326 . [CSA]
   Google Scholar
• Guinet , A. 1993 . Scheduling sequence-dependent jobs on identical parallel machines to minimize completion criteria . International Journal of Production Research , 31 : 1579 – 1594 . [CSA]
   Web of Science ®Google Scholar
• Gupta , A. K. and Sivakumar , A. I. 2005 . Single machine scheduling with multiple objectives in semiconductor manufacturing . The International Journal of Advanced Manufacturing Technology , 26 : 950 – 958 . [CSA]
   Web of Science ®Google Scholar
• Gupta , D. and Magnusson , T. 2005 . The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times . Computers & Operations Research , 32 ( 4 ) : 727 – 747 . [CSA]
   Web of Science ®Google Scholar
• Gupta , J. N.D. 1986 . Flowshop schedules with sequence dependent setup times . Journal of the Operations Research Society of Japan , 29 : 206 – 219 . [CSA]
   Web of Science ®Google Scholar
• Gupta , J. N.D. and Darrow , W. P. 1986 . The two-machine sequence dependent flowshop scheduling problem . European Journal of Operational Research , 24 : 439 – 446 . [CROSSREF] [CSA]
   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 ( 5 ) : 643 – 656 . [CSA]
   Web of Science ®Google Scholar
• Haase , K. 1994 . Lotsizing and scheduling for production planning (Lecture Notes in Economics and Mathematical Systems) , Berlin : Springer-Verlag .
   Google Scholar
• Haase , K. 1996 . Capacitated lotsizing with sequence dependent setup costs . Operations Research Spektrum , 18 : 51 – 59 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Haase , K. and Kimms , A. 2000 . Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities . International Journal of Production Economics , 66 ( 2 ) : 159 – 169 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hashiba , S. and Chang , T. C. 1991 . PCB assembly set-up reduction using group technology . Computers & Industrial Engineering , 21 ( 1/4 ) : 453 – 457 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Heady , R. B. and Zhu , Z. 1998 . Minimizing the sum of job earliness and tardiness in a multimachine system . International Journal of Production Research , 36 ( 6 ) : 1619 – 1632 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hertz , A. and Widmer , M. 1996 . An improved tabu search approach for solving the job shop scheduling problem with tooling constraints . Discrete Applied Mathematics , 65 : 319 – 345 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hop , N. V. and Nagarur , N. N. 2004 . The scheduling problem of PCBs for multiple non-identical parallel machines . European Journal of Operational Research , 158 : 577 – 594 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hui , C. , Gupta , A. and Van der Meulen , H. A.J. 2000 . A novel MILP formulation for short-term scheduling of multistage multi-product batch plants . Computers & Chemical Engineering , 24 ( 2/7 ) : 1611 – 1617 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hurink , J. and Knust , S. 2001 . List scheduling in a parallel machine environment with precedence constraints and setup times . Operations Research Letters , 29 ( 5 ) : 231 – 239 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hwang , H. and Sun , J. U. 1997 . Production sequencing problem with reentrant work flows and sequence dependent setup times . Computers & Industrial Engineering , 33 ( 3/4 ) : 773 – 776 . [CROSSREF] [CSA]
   Web of Science ®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 ( 9 ) : 2435 – 2450 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Johnson , D. S. and Papadimitriou , C. H. 1985 . “ Computational complexity ” . In The Traveling Salesman Problem , Edited by: Lawler , E. L. , Lenstra , J. K. , Rinnooy , A. H.G. and Shmoys , D. B. 37 – 85 . Chichester, UK : Wiley .
   Google Scholar
• Johnson , S. M. 1954 . Optimal two-and three-stage production schedules with set-up times included . Naval Research Logistics Quarterly , 1 : 61 – 68 . [CSA]
   Google Scholar
• Jordan , C. and Drexl , A. 1998 . Discrete lotsizing and scheduling by batch sequencing . Management Science , 44 ( 5 ) : 698 – 713 . [CSA]
   Web of Science ®Google Scholar
• Kang , S. , Malik , K. and Thomas , L. 1999 . Lotsizing and scheduling on parallel machines with sequence-dependent setup costs . Management Science , 45 ( 2 ) : 273 – 289 . [CSA]
   Web of Science ®Google Scholar
• Karimi , B. , Fatemi Ghomi , S. M.T. and Wilson , J. M. 2003 . The capacitated lot-sizing problem: a review of models and algorithms . Omega , 31 : 365 – 378 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kim , C. O. and Shin , H. J. 2003 . Scheduling jobs on parallel machines: a restricted tabu search approach . The International Journal of Advanced Manufacturing Technology , 22 ( 3/4 ) : 278 – 287 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kim , D. , Kim , K. , Jang , W. and Chen , F. F. 2002 . Unrelated parallel machine scheduling with setup times using simulated annealing . Robotics and Computer-Integrated Manufacturing , 18 ( 3/4 ) : 223 – 231 . [CROSSREF] [CSA]
   Web of Science ®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 ( 7 ) : 1503 – 1520 . [CSA]
   Web of Science ®Google Scholar
• Kim , S. C. and Bobrowski , P. M. 1997 . Scheduling jobs with uncertain setup times and sequence dependency . Omega , 25 ( 4 ) : 437 – 447 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kim , S.-S. , Shin , H. J. , Eom , D.-H. and Kim , C.-O. 2003 . A due date density-based categorising heuristic for parallel machines scheduling . The International Journal of Advanced Manufacturing Technology , 22 ( 9/10 ) : 753 – 760 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kim , S.-Y. , Lee , Y.-H. and Agnihotri , D. 1995 . A hybrid approach to sequencing jobs using heuristic rules and neural networks . Production Planning & Control , 6 ( 5 ) : 445 – 454 . [CSA]
   Web of Science ®Google Scholar
• Kim , Y. , Lim , H. and Park , M. 1996 . Search heuristics for a flow shop scheduling problem in a printed circuit board assembly process . European Journal of Operational Research , 91 ( 1 ) : 124 – 143 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kirkpatrick , S. , Gelatt , C. D. and Vecchi , M. P. 1983 . Optimization by simulated annealing . Science , 220 : 671 – 680 . [CSA]
   PubMed Web of Science ®Google Scholar
• Kochhar , S. and Morris , R. J.T. 1987 . Heuristic methods for flexible flow line scheduling . Journal of Manufacturing Systems , 6 ( 4 ) : 299 – 314 . [CSA]
   Web of Science ®Google Scholar
• Kolahan , F. and Liang , M. 1998 . An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups . European Journal of Operational Research , 109 : 142 – 159 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kolahan , F. , Liang , M. and Zuo , M. 1995 . Solving the combined part sequencing and tool replacement problem for an automated machine center: a tabu search approach . Computers & Industrial Engineering , 28 : 731 – 743 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kurz , M. E. and Askin , R. G. 2001 . Heuristic scheduling of parallel machines with sequence-dependent set-up times . International Journal of Production Research , 39 ( 16 ) : 3747 – 3769 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kurz , M. E. and Askin , R. G. 2003 . Comparing scheduling rules for flexible flow lines . International Journal of Production Economics , 85 ( 3 ) : 371 – 388 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kurz , M. E. and Askin , R. G. 2004 . Scheduling flexible flow lines with sequence-dependent setup times . European Journal of Operational Research , 159 : 66 – 82 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Laguna , M. 1999 . A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times . IIE Transactions , 31 ( 2 ) : 125 – 134 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Laguna , M. and Glover , F. W. 1993 . Integrating target analysis and tabu search for improved scheduling systems . Expert Systems with Applications , 6 : 287 – 297 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Lee , I. , Sikora , R. and Shaw , M. J. 1997 . A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes . IEEE Transactions on System, Man, and Cybernetics—Part B: Cybernetics , 27 ( 1 ) : 36 – 54 . [CROSSREF] [CSA]
   PubMed Web of Science ®Google Scholar
• Lee , Y. H. , Bhaskaran , K. and Pinedo , M. 1992 . A heuristic to minimize the total weighted tardiness with sequence dependent setups , NY : IEOR Department, Columbia University . Technical Report
   Google Scholar
• Lee , Y. H. , Bhaskaran , K. and Pinedo , M. 1997 . A heuristic to minimize the total weighted tardiness with sequence-dependent setups . IIE Transactions , 29 ( 1 ) : 45 – 52 . [CSA]
   Web of Science ®Google Scholar
• Lee , Y. H. and Pinedo , M. 1997 . Scheduling jobs on parallel machines with sequence-dependent setup times . European Journal of Operational Research , 100 : 464 – 474 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Leon , V. J. and Wu , S. D. 1992 . On scheduling with ready-times, due-dates and vacations . Naval Research Logistics , 39 : 53 – 65 . [CSA]
   Web of Science ®Google Scholar
• Little , J. D.C. , Murty , K. G. , Sweeney , D. W. and Karel , C. 1963 . An algorithm for the traveling salesman problem . Operations Research , 11 : 972 – 989 . [CSA]
   Web of Science ®Google Scholar
• Logendran , R. , Gelogullari , C. A. and Sriskandarajah , C. 2003 . Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency . Robotics and Computer Integrated Manufacturing , 19 : 21 – 33 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Logendran , R. , Salmasia , N. and Sriskandarajah , C. 2006 . Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups . Computers & Operations Research , 33 : 158 – 180 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Low , C. 1995 . Job shop scheduling heuristics for sequence dependent setups . Computers & Industrial Engineering , 29 ( 1/4 ) : 279 – 283 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Luh , P. B. , Gou , L. , Zhang , Y. , Nagahora , T. , Tsuji , M. , Yoneda , K. , Hasegawa , T. , Kyoya , Y. and Kano , T . 1998 . Job shop scheduling with group-dependent setups, finite buffers and long time horizon . Annals of Operations Research: Mathematics of Industrial Systems , 76 : 233 – 259 . [CSA]
   Web of Science ®Google Scholar
• Maimon , O. Z. , Dar-El , E. M. and Carmon , T. F. 1993 . Set-up saving schemes for printed circuit boards assembly . European Journal of Operational Research , 70 : 177 – 190 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Mason , S. J. , Fowler , J. W. and Carlyle , W. M. 2002 . A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops . Journal of Scheduling , 5 ( 3 ) : 247 – 262 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Mason , S. J. , Fowler , J. W. , Carlyle , W. M. and Montgomery , D. C. 2005 . Heuristics for minimizing total weighted tardiness in complex job shops . International Journal of Production Research , 43 : 1943 – 1963 . [CSA]
   Web of Science ®Google Scholar
• Maxwell , W. L. 1964 . The scheduling of economic lot sizes . Naval Research Logistics Quarterly , 11 ( 2/3 ) : 89 – 124 . [CSA]
   Google Scholar
• McGinnis , L. F. , Ammons , J. C. , Carlyle , M. , Cranmer , L. , Depuy , G. W. , Ellis , K. P. , Tovey , C. A. and Xu , H. 1992 . Automated process planning for printed circuit card assembly . IIE Transactions , 24 ( 4 ) : 18 – 30 . [CSA]
   Web of Science ®Google Scholar
• Mendes , A. S. , Müller , F. M. , França , P. M. and Moscato , P. 2002 . Comparing meta-heuristic approaches for parallel machine scheduling problems . Production Planning & Control , 13 ( 2 ) : 143 – 154 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Mendez , C. A. , Henning , G. P. and Cerde , J. 2001 . An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities . Computers & Chemical Engineering , 25 ( 4/6 ) : 701 – 711 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Meyr , H. 2000 . Simultaneous lotsizing and scheduling by combining local search with dual reoptimization . European Journal of Operational Research , 120 ( 2 ) : 311 – 326 . [CSA]
   Web of Science ®Google Scholar
• Meyr , H. 2002 . Simultaneous lotsizing and scheduling on parallel machines . European Journal of Operational Research , 139 ( 2 ) : 277 – 292 . [CSA]
   Web of Science ®Google Scholar
• Miller , M. D. , Chen , H.-C. , Matson , J. and Liu , Q. 1999 . A hybrid genetic algorithm for the single machine scheduling problem . Journal of Heuristics , 5 : 437 – 454 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Monma , C. L. and Potts , C. N. 1989 . On the complexity of scheduling with batch setup times . Operations Research , 37 ( 5 ) : 798 – 804 . [CSA]
   Web of Science ®Google Scholar
• Moscato , P. 1989 . On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms , Caltech, Pasadena, CA : Caltech Concurrent Computation Program . C3P Report 826
   Google Scholar
• Moscato , P. 1999 . “ Memetic algorithms: a short introduction ” . In New Ideas in Optimization , Edited by: Corne , D. , Dorigo , M. and Glover , F. 219 – 234 . London : McGraw-Hill .
   Google Scholar
• Norman , B. A. 1999 . Scheduling flowshops with finite buffers and sequence-dependent setup times . Computers & Industrial Engineering , 36 ( 1 ) : 163 – 177 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Osman , I. H. and Potts , C. N. 1989 . Simulated annealing for permutation flow-shop scheduling . Omega , 17 ( 6 ) : 551 – 557 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1993 . Worst-case error bounds for parallel machines scheduling problems with sequence-dependent setup times . Operations Research Letters , 14 : 251 – 256 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1994a . Exploiting shop floor status information to schedule complex job shops . Journal of Manufacturing Systems , 13 ( 2 ) : 73 – 84 . [CSA]
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1994b . Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times . International Journal of Production Research , 32 ( 6 ) : 1243 – 1263 . [CSA]
   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 ( 11 ) : 3173 – 3192 . [CSA]
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1997 . Decomposition Methods for Complex Factory Scheduling Problems , Dordrecht, , The Netherlands : Kluwer .
   Google Scholar
• Ozgur , C. O. and Brown , J. R. 1995 . A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem . Omega , 23 ( 2 ) : 205 – 219 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Palmer , D. S. 1965 . Sequencing jobs through a multistage process in the minimum total time – a quick method of obtaining a near optimum . Operational Research Quarterly , 16 ( 1 ) : 101 – 107 . [CSA]
   Google Scholar
• Papadimitriou , C. H. and Steiglitz , K. 1998 . Combinatorial Optimization: Algorithms and Complexity , New York, NY : Mineola .
   Google Scholar
• Park , Y. , Kim , S. and Lee , Y. 2000 . Scheduling jobs on parallel machines applying neural network and heuristic rules . Computers & Industrial Engineering , 38 ( 1 ) : 189 – 202 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Parthasarathy , S. and Rajendran , C. 1997a . An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs . International Journal of Production Economics , 49 ( 3 ) : 255 – 263 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Parthasarathy , S. and Rajendran , C. 1997b . A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs – a case study . Production Planning & Control , 8 ( 5 ) : 475 – 483 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Pearn , W. L. , Chung , S. H. , Chen , A. Y. and Yang , M. H. 2004 . A case study on the multistage IC final testing scheduling problem with reentry . International Journal of Production Economics , 88 ( 3 ) : 257 – 267 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Pinedo , M. 2002 . Scheduling: Theory, Algorithms and Systems, , 2nd edn. , Englewood Cliffs, NJ : Prentice Hall .
   Google Scholar
• Potts , C. N. and Van Wassenhove , L. N. 1992 . Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity . Journal of the Operations Research Society , 43 ( 5 ) : 395 – 406 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Pugazhendhi , S. , Thiagarajan , S. , Rajendran , C. and Anantharaman , N. 2004 . Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach . The International Journal of Advanced Manufacturing Technology , 23 ( 1/2 ) : 64 – 78 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rabadi , G. , Mollaghasemi , M. and Anagnostopoulos , G. C. 2004 . A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time . Computers & Operations Research , 31 : 1727 – 1751 . [CROSSREF] [CSA]
   Web of Science ®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 ( 10 ) : 2233 – 2252 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Ragatz , G. L. A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times . Proceedings of the 24th Annual Meeting of the Decision Sciences Institute . pp. 1375 – 1377 .
   Google Scholar
• Rajendran , C. and Ziegler , H. 1997 . A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs . Computers & Industrial Engineering , 33 ( 1/2 ) : 281 – 284 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rajendran , C. and Ziegler , H. 2003 . Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times . European Journal of Operational Research , 149 ( 3 ) : 513 – 522 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rajkumar , K. and Narendran , T. T. 1998 . A heuristic for sequencing PCB assembly to minimize setup times . Production Planning & Control , 9 ( 5 ) : 465 – 476 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Raman , N. , Rachamadugu , R. V. and Talbot , F. B. 1989 . Real time scheduling of an automated manufacturing center . European Journal of Operational Research , 40 : 222 – 242 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Reeves , C. R. 1995 . A genetic algorithm for flowshop sequencing . Computers & Operations Research , 22 ( 1 ) : 5 – 13 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Reinelt , G. 1994 . The Traveling Salesman: Combinatorial Solutions for TSP Applications , Berlin : Springer-Verlag .
   Google Scholar
• Rios-Mercado , R. Z. and Bard , J. F. 1998a . Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups . Computers & Operations Research , 25 ( 5 ) : 351 – 366 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rios-Mercado , R. Z. and Bard , J. F. 1998b . Heuristics for the flow line problem with setup costs . European Journal of Operational Research , 110 ( 1 ) : 76 – 98 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rios-Mercado , R. Z. and Bard , J. F. 1999a . A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times . IIE Transactions , 31 ( 8 ) : 721 – 731 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rios-Mercado , R. Z. and Bard , J. F. 1999b . An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times . Journal of Heuristics , 5 ( 1 ) : 57 – 74 . [CSA]
   Web of Science ®Google Scholar
• Roslöf , J. , Harjunkoski , I. , Westerlund , T. and Isaksson , J. 2002 . Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure . European Journal of Operational Research , 138 : 29 – 42 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Rossetti , M. D. and Stanford , K. J.A. 2003 . Group sequencing a PCB assembly system via an expected sequence dependent setup heuristic . Computers & Industrial Engineering , 45 ( 1 ) : 231 – 254 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Roy , B. and Sussman , B. 1964 . Les problèmes d'ordonnancement avec contraintes disjonctives . SEMA , : 9 Note D.S.[CSA]
   Google Scholar
• Rubin , P. A. and Ragatz , G. L. 1995 . Scheduling in a sequence dependent setup environment with genetic search . Computers & Operations Research , 22 ( 1 ) : 85 – 99 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Ruiz , R. and Maroto , C. 2006 . A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility . European Journal of Operational Research , 169 : 781 – 800 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Ruiz , R. , Maroto , C. and Alcaraz , J. 2005 . Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics . European Journal of Operational Research , 165 : 34 – 54 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Salomon , M. , Solomon , L. , Van Wassenhove , L. N. , Dumas , J. and Dauzere-Peres , S. 1997 . Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the traveling salesman problem with time windows . European Journal of Operational Research , 100 : 494 – 513 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Schaller , J. E. , Gupta , J. N.D. and Vakharia , A. J. 2000 . Scheduling a flowline manufacturing cell with sequence dependent family setup times . European Journal of Operational Research , 125 ( 2 ) : 324 – 339 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Schutten , J. M.J. 1996 . List scheduling revisited . Operations Research Letters , 18 ( 4 ) : 167 – 170 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Shailendra , J. , Eric , J. M. and Fereydoon , S. 1996 . Implementing setup optimization on the shop floor . Operations Research , 44 ( 6 ) : 843 – 851 . [CSA]
   Web of Science ®Google Scholar
• Sikora , R. 1996 . A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line . Computers & Industrial Engineering , 30 ( 4 ) : 969 – 981 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Sikora , R. , Chhajed , D. and Shaw , M. J. 1996 . Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line . Computers & Industrial Engineering , 30 ( 4 ) : 659 – 679 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Silver , E. A. and Meal , H. C. 1973 . A heuristic selecting lot size requirement for the case of a deterministic time varying demand rate and discrete opportunities for replenishment . Production and Inventory Management , 14 : 64 – 74 . [CSA]
   Google Scholar
• Simons , J. V. Jr. 1992 . Heuristics in flow shop scheduling with sequence dependent setup times . Omega , 20 ( 2 ) : 215 – 225 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Sivrikaya-Serifoglu , F. and Ulusoy , G. 1999 . Parallel machine scheduling with earliness and tardiness penalties . Computers & Operations Research , 26 ( 8 ) : 773 – 787 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Spina , R. , Galantucci , L. M. and Dassisti , M. 2003 . A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time . Computers & Industrial Engineering , 45 ( 4 ) : 573 – 583 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Srikar , B. N. and Ghosh , S. 1986 . A MILP model for the n-job, M-stage flowshop, with sequence dependent setup times . International Journal of Production Research , 24 ( 6 ) : 1459 – 1472 . [CSA]
   Web of Science ®Google Scholar
• Stafford , E. F. Jr. and Tseng , F. T. 1990 . On the Sriker-Ghosh MILP model for the N× M SDST flowshop problem . International Journal of Production Research , 28 ( 10 ) : 1817 – 1830 . [CSA]
   Web of Science ®Google Scholar
• Stafford , E. F. Jr. and Tseng , F. T. 2002 . Two models for a family of flowshop sequencing problems . European Journal of Operational Research , 142 ( 2 ) : 282 – 293 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Stutzle , T. 1998 . Applying iterated local search to the permutation flow shop problem , Technical report, AIDA-98-04 Darmstadt, , Germany : FG Intellektik, TU Darmstadt .
   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 ( 3 ) : 375 – 385 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Sun , J. U. , Yee , S. R. and Hwang , H. 2003 . Job shop scheduling with sequence dependent setup times to minimize makespan . International Journal of Industrial Engineering—Theory Applications and Practice , 10 ( 4 ) : 455 – 461 . [CSA]
   Web of Science ®Google Scholar
• Sun , X. , Noble , J. S. and Klein , C. M. 1999 . Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness . IIE Transactions , 31 ( 2 ) : 113 – 124 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Taillard , E. 1993 . Benchmarks for basic scheduling problems . European Journal of Operational Research , 64 : 278 – 285 . [CSA]
   Web of Science ®Google Scholar
• Tan , K. C. and Narasimhan , R. 1997a . Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach . Omega , 25 ( 6 ) : 619 – 634 . [CSA]
   Web of Science ®Google Scholar
• Tan , K. C. and Narasimhan , R. 1997b . Multi-objective sequencing with sequence dependent setup times . International Journal of Operations and Quantitative Management , 3 : 69 – 84 . [CSA]
   Google Scholar
• Tan , K. C. , Narasimhan , R. , Rubin , P. A. and Ragatz , G. L. 2000 . A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times . Omega , 28 ( 3 ) : 313 – 326 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Thizy , J. M. and Van Wassenhove , L. N. 1985 . Lagrangean relaxation for the multi-item capacitated lot-sizing problem: a heuristic implementation . IIE Transactions , 17 ( 4 ) : 308 – 313 . [CSA]
   Web of Science ®Google Scholar
• Trigeiro , W. W. , Thomas , L. J. and McClain , J. O. 1989 . Capacitated lot sizing with setup times . Management Science , 35 ( 3 ) : 353 – 366 . [CSA]
   Web of Science ®Google Scholar
• Unal , A. T. , Uzsoy , R. and Kiran , A. S. 1997 . Rescheduling on a single machine with part-type dependent setup times and deadlines . Annuals of Operations Research , 70 : 93 – 113 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Uzsoy , R. , Lee , C. Y. and Martin-Vega , L. A. 1992 . Scheduling semiconductor test operations: minimizing maximum lateness and number of tardy jobs on a single machine . Naval Research Logistics , 39 : 369 – 388 . [CSA]
   Web of Science ®Google Scholar
• Uzsoy , R. , Martin-Vega , L. A. , Lee , C. Y. and Leonard , P. A. 1991 . Production scheduling algorithms for a semiconductor testing facility . IEEE Transactions on Semiconductor Manufacturing , 4 : 270 – 280 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Vallada , E. , Ruiz , R. and Maroto , C. 2003 . Synthetic and real benchmarks for complex flow-shop problems , Valencia, Spain : Grupo de Investigatión Operativa GIO, Universidad Politécnica de Valencia . Technical report,
   Google Scholar
• Wagner , B. J. and Davis , D. J. 2002 . A search heuristic for the sequence-dependent economic lot scheduling problem . European Journal of Operational Research , 141 ( 1 ) : 133 – 146 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Weng , M. X. , Lu , J. and Ren , H. 2001 . Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective . International Journal of Production Economics , 70 ( 3 ) : 215 – 226 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Widmer , M. and Hertz , A. 1989 . A new heuristic method for the flow shop sequencing problem . European Journal of Operational Research , 41 : 186 – 193 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Wilbrecht , J. K. and Prescott , W. B. 1969 . The influence of set-up time on job shop performance . Management Science , 16 : B274 – B280 . [CSA]
   Web of Science ®Google Scholar
• Wilhelm , W. E. and Tarmy , P. K. 2003 . Circuit card assembly on tandem turret-type placement machines . IIE Transactions , 35 : 627 – 645 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Woodruff , D. L. and Spearman , M. L. 1992 . Sequencing and batching for two classes of job with deadlines and setup times . Production and Operations Management , 1 : 87 – 102 . [CSA]
   Google Scholar
• Yalaoui , F. and Chu , C. 2003 . An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times . IIE Transactions , 35 : 183 – 190 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Yang , W. H. and Liao , C. J. 1999 . Survey of scheduling research involving setup times . International Journal of Systems Science , 30 ( 2 ) : 143 – 155 . [CROSSREF] [CSA]
   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 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar