Permutation flow shops with exact time lags to minimise maximum lateness

References

• Ageev , AA and Baburin , AE . 2007 . Approximation algorithms for UET scheduling problems with exact delays . Operations Research Letters , 35 : 533 – 540 .
   Web of Science ®Google Scholar
• Allahverdi , A and Aldowaisan , T . 2001 . Minimising total completion time in a no-wait flowshop with sequence-dependent additive changeover times . Journal of the Operational Research Society , 52 : 449 – 462 .
   Web of Science ®Google Scholar
• Brucker , P , Hilbig , T and Hurink , J . 1999 . A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags . Discrete Applied Mathematics , 94 : 77 – 99 .
   Web of Science ®Google Scholar
• Brucker , P and Knust , S . 1999 . Complexity results for single-machine problems with positive finish–start time-lags . Computing , 63 : 299 – 316 .
   Web of Science ®Google Scholar
• Bruno , J , Jones , JW III and So , K . 1980 . Deterministic scheduling with pipelined processors . IEEE Transactions on Computers , 29 : 308 – 316 .
   Google Scholar
• Chen , J-S and Yang , J-S . 2006 . Model formulations for the machine scheduling problem with limited waiting time constraints . Journal of Information and Optimization Sciences , 27 : 225 – 240 .
   Google Scholar
• Chu , C and Proth , J-M . 1996 . Single machine scheduling with chain structured precedence constraints and separation time windows . IEEE Transactions on Robotics and Automation , 12 : 835 – 844 .
   Google Scholar
• Dell'Amico , M . 1996 . Shop problems with two machines and time lags . Operations Research , 44 : 777 – 787 .
   Web of Science ®Google Scholar
• Dileepan , P . 2004 . A note on minimising maximum lateness in a two-machine no-wait flowshop . Computers and Operations Research , 31 : 2111 – 2115 .
   Google Scholar
• Finke , G , Espinouse , M-L and Jiang , H . 2002 . General flowshop models: job dependent capacities, job overlapping and deterioration . International Transactions in Operational Research , 9 : 399 – 414 .
   Google Scholar
• Fondrevelle , J . 2005 . Résolution exacte de problemes d'ordonnancement de type flowshop de permutation en présence de contraintes d'écarts temporels entre opérations. Thesis (PhD) , France : Institut National Polytechnique de Lorraine . (in French)
   Google Scholar
• Fondrevelle , J , Allahverdi , A and Oulamara , A . 2005 . Two-machine no-wait flowshop scheduling problem to minimise maximum lateness with separate setup and removal times . International Journal of Agile Manufacturing , 8 ( 2 ) : 165 – 174 .
   Google Scholar
• Fondrevelle , J , Oulamara , A and Portmann , M-C . 2006 . Permutation flowshop scheduling problems with maximal and minimal time lags . Computers and Operations Research , 33 : 1540 – 1556 .
   Web of Science ®Google Scholar
• Gilmore , PC and Gomory , RE . 1964 . Sequencing a one state-variable machine: a solvable case of the traveling salesman problem . Operations Research , 12 : 655 – 679 .
   Web of Science ®Google Scholar
• Hall , N and Sriskandarajah , C . 1996 . A survey of machine scheduling problems with blocking and no-wait in process . Operations Research , 44 : 510 – 525 .
   Web of Science ®Google Scholar
• Hodson , A , Muhlemann , AP and Price , DHR . 1985 . A microcomputer based solution to a practical scheduling problem . Journal of the Operational Research Society , 36 : 903 – 914 .
   Web of Science ®Google Scholar
• Ignall , EJ and Schrage , LE . 1965 . Application of the branch and bound technique to some flow-shop scheduling problems . Operations Research , 13 : 400 – 412 .
   Web of Science ®Google Scholar
• Janczewski , R and Kubale , M . 2001 . Scheduling unit execution time tasks with symmetric time-lags . Journal of Applied Computer Science , 9 : 45 – 51 .
   Google Scholar
• Johnson , SM . 1954 . Optimal two- and three-stage production schedules with setup times included . Naval Research Logistics Quarterly , 1 : 61 – 68 .
   Google Scholar
• Kim , Y-D , Lim , H-G and Park , M-W . 1996 . Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process . European Journal of Operational Research , 91 : 124 – 143 .
   Web of Science ®Google Scholar
• Ladhari , T and Haouari , M . 2005 . A computational study of the permutation flow shop problem based on a tight lower bound . Computers and Operations Research , 32 : 1831 – 1847 .
   Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1977 . Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Mitten , LG . 1959 . Sequencing n jobs on two machines with arbitrary time lags . Management Science , 5 : 293 – 298 .
   Web of Science ®Google Scholar
• Monma , CL and Rinnooy Kan , AHG . 1983 . A concise survey of efficiently solvable special cases of the permutation flow-shop problem . R.A.I.R.O. Recherche Opérationnelle , 17 : 105 – 119 .
   Web of Science ®Google Scholar
• Nawaz , M , Enscore Jr , EE and Ham , I . 1983 . A heuristic algorithm for the m-machine, n-job flow shop sequencing problem . Omega , 11 : 91 – 95 .
   Web of Science ®Google Scholar
• Orman , AJ and Potts , CN . 1997 . On the complexity of coupled-task scheduling . Discrete Applied Mathematics , 72 : 141 – 154 .
   Web of Science ®Google Scholar
• Potts , CN . 1980 . An adaptive branching rule for the permutation flow-shop problem . European Journal of Operational Research , 5 : 19 – 25 .
   Web of Science ®Google Scholar
• Potts , CN and Van Wassenhove , LN . 1982 . A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 : 177 – 181 .
   Google Scholar
• Roeck , H . 1984 . Some new results in flowshop scheduling . Zeitschrift fur Operations Research , 28 : 1 – 16 .
   Google Scholar
• Shapiro , RD . 1981 . Scheduling coupled-tasks . Naval Research Logistics Quarterly , 28 : 489 – 497 .
   Google Scholar
• Szwarc , W . 1986 . The flow shop problem with time lags and separated setup times . Zeitschrift fur Operations Research , 30 : B15 – B22 .
   Google Scholar