Coordinated scheduling of a single machine with sequence-dependent setup times and time-window constraints

References

• Ahmadi , RH and Bagchi , U . 1992 . Minimizing job idleness in deadline constrained environments . Operations Research , 40 ( 5 ) : 972 – 985 .
   Web of Science ®Google Scholar
• Allahverdi , A , Gupta , JND and Aldowaisan , T . 1999 . A review of scheduling research involving setup considerations . Omega , 27 ( 2 ) : 219 – 239 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2008 . A survey of scheduling problems with setup times or costs . European Journal of Operational Research , 187 ( 3 ) : 985 – 1032 .
   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 .
   Web of Science ®Google Scholar
• Ascheuer , N , Fischetti , M and Grötschel , M . 2001 . Solving the asymmetric travelling salesman problem with time windows by branch-and-cut . Mathematical Programming , 90 ( 3 ) : 475 – 506 .
   Web of Science ®Google Scholar
• Belouadah , ME . 1992 . Scheduling with release dates on a single machine to minimize total weighted completion time . Discrete Applied Mathematics , 36 ( 3 ) : 213 – 231 .
   Web of Science ®Google Scholar
• Bianco , L and Ricciardelli , S . 1982 . Scheduling of a single machine to minimize total weighted completion time subject to release dates . Naval Research Logistics Quarterly , 29 ( 1 ) : 151 – 167 .
   Google Scholar
• Carlton , WB and Barnes , JW . 1996 . Solving the traveling-salesman problem with time windows using tabu search . IIE transactions , 28 ( 8 ) : 617 – 629 .
   Web of Science ®Google Scholar
• Chand , S and Schneeberger , H . 1988 . Single machine scheduling to minimize weighted earliness subject to no tardy jobs . European Journal of Operational Research , 34 ( 2 ) : 221 – 230 .
   Web of Science ®Google Scholar
• Dumas , Y . 1995 . An optimal algorithm for the traveling salesman problem with time windows . Operations Research , 43 ( 2 ) : 367 – 371 .
   Web of Science ®Google Scholar
• Garey , MR and Johnson , DS . 1979 . Computers and intractability: a guide to the theory of NP-completeness , San Francisco : Freeman .
   Google Scholar
• Gélinas , S and Soumis , F . 1997 . A dynamic programming algorithm for single machine scheduling with ready times . Annals of Operations Research , 69 ( 0 ) : 135 – 156 .
   Web of Science ®Google Scholar
• Gendreau , M . 1998 . A generalized insertion heuristic for the traveling salesman problem with time windows . Operations Research , 46 ( 3 ) : 330 – 335 .
   Web of Science ®Google Scholar
• Golumbic , MC . 2004 . Algorithmic graph theory and perfect graphs , Amsterdam : North-Holland .
   Google Scholar
• Hariri , AMA and Potts , CN . 1983 . An algorithm for single machine sequencing with release dates to minimize total weighted completion time . Discrete Applied Mathematics , 5 ( 1 ) : 99 – 109 .
   Web of Science ®Google Scholar
• Hsiao , JY , Tang , CY and Chang , RS . 1992 . An efficient algorithm for finding a maximum weight 2-independent set on interval graphs . Information Processing Letters , 43 ( 5 ) : 229 – 235 .
   Web of Science ®Google Scholar
• Jula , P and Leachman , RC . 2008 . Coordinating decentralized local schedulers in complex supply chain manufacturing . Annals of Operations Research , 161 ( 1 ) : 123 – 147 .
   Web of Science ®Google Scholar
• Jula , P and Leachman , RC . 2010 . Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints . Operations Research , 58 ( 4 Part 1 ) : 933 – 947 .
   Web of Science ®Google Scholar
• Kedad-Sidhoum , S and Sourd , F . 2010 . Fast neighborhood search for the single machine earliness–tardiness scheduling problem . Computers & Operations Research , 37 ( 8 ) : 1464 – 1471 .
   Web of Science ®Google Scholar
• Leachman , RC , Kang , J and Lin , V . 2002 . SLIM: short cycle time and low inventory in manufacturing at Samsung Electronics . Interfaces , 32 ( 1 ) : 61 – 77 .
   Web of Science ®Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1977 . “ Complexity of machine scheduling problems ” . In Studies in integer programming , Edited by: Hammer , PL . 343 – 362 . Amsterdam : Elsevier .
   Google Scholar
• Li , X , Wang , Q and Wu , C . 2008 . Heuristic for no-wait flow shops with makespan minimization . International Journal of Production Research , 46 ( 9 ) : 2519 – 2530 .
   Web of Science ®Google Scholar
• Pan , Y and Shi , L . 2005 . Dual constrained single machine sequencing to minimize total weighted completion time . IEEE Transactions on Automation Science and Engineering , 2 ( 4 ) : 344 – 357 .
   Web of Science ®Google Scholar
• Posner , ME . 1985 . Minimizing weighted completion times with deadlines . Operations Research , 33 ( 3 ) : 562 – 574 .
   Web of Science ®Google Scholar
• Potts , CN and Van Wassenhove , LN . 1983 . An algorithm for single machine sequencing with deadlines to minimize total weighted completion time . European Journal of Operational Research , 12 ( 4 ) : 379 – 387 .
   Web of Science ®Google Scholar
• Ruiz , R and Allahverdi , A . 2009 . New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness . International Journal of Production Research , 47 ( 20 ) : 5717 – 5738 .
   Web of Science ®Google Scholar
• Smith , WE . 1956 . Various optimizers for single-stage production . Naval Research Logistics Quarterly , 3 ( 1/2 ) : 59 – 66 .
   Google Scholar
• Sourd , F . 2006 . Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints . Operations Research Letters , 34 ( 5 ) : 591 – 598 .
   Web of Science ®Google Scholar
• Zhu , X and Wilhelm , WE . 2006 . Scheduling and lot sizing with sequence-dependent setup: a literature review . IIE transactions , 38 ( 11 ) : 987 – 1007 .
   Web of Science ®Google Scholar