New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness

References

• Aldowaisan , T and Allahverdi , A . 2003 . New heuristics for no-wait flowshops to minimize makespan . Computers & Operations Research , 30 ( 8 ) : 1219 – 1231 .
   Web of Science ®Google Scholar
• Allahverdi , A and Aldowaisan , T . 2000 . No-wait and separate setup three-machine flowshop with total completion time criterion . International Transactions in Operational Research , 7 ( 3 ) : 245 – 264 .
   Google Scholar
• Allahverdi , A and Aldowaisan , T . 2002 . No-wait flowshops with bicriteria of makespan and total completion time . Journal of the Operational Research Society , 53 ( 9 ) : 1004 – 1015 .
   Web of Science ®Google Scholar
• Allahverdi , A and Aldowaisan , T . 2004 . No-wait flowshops with bicriteria of makespan and maximum lateness . European Journal of Operational Research , 152 ( 1 ) : 132 – 147 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2008 . A survey of scheduling problems with setup times or costs . European Journal of Operational Research , 187 : 985 – 1032 .
   Web of Science ®Google Scholar
• Allahverdi , A and Soroush , HM . 2008 . The significance of reducing setup times/setup costs . European Journal of Operational Research , 187 : 978 – 984 .
   Web of Science ®Google Scholar
• Augusto , V , Xie , X and Perdomo , V . 2008 . Operating theatre scheduling using Lagrangian relaxation . European Journal of Industrial Engineering , 2 ( 2 ) : 172 – 189 .
   Web of Science ®Google Scholar
• Bagchi , TP , Gupta , JND and Sriskandarajah , C . 2006 . A review of TSP based approaches for flowshop scheduling . European Journal of Operational Research , 169 ( 3 ) : 816 – 854 .
   Web of Science ®Google Scholar
• Ben Hmida , A . 2007 . Climbing depth-bounded discrepancy search for solving hybrid flow shop problems . European Journal of Industrial Engineering , 1 ( 2 ) : 223 – 240 .
   Web of Science ®Google Scholar
• Bonney , MC and Gundry , SW . 1976 . Solutions to the constrained flowshop sequencing problem . Operational Research Quarterly , 27 ( 4 ) : 869 – 883 .
   Google Scholar
• Brown , SI , McGarvey , R and Ventura , JA . 2004 . Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated . Journal of the Operational Research Society , 55 ( 6 ) : 614 – 621 .
   Web of Science ®Google Scholar
• Chandrasekaran , C . 2007 . Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach . European Journal of Industrial Engineering , 1 ( 2 ) : 152 – 181 .
   Web of Science ®Google Scholar
• Dileepan , P . 2004 . A note on minimizing maximum lateness in a two-machine no-wait flowshop . Computers & Operations Research , 31 ( 12 ) : 2111 – 2115 .
   Web of Science ®Google Scholar
• Framinan , JM , Leisten , R and Rajendran , C . 2003 . Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem . International Journal of Production Research , 41 ( 1 ) : 121 – 148 .
   Web of Science ®Google Scholar
• Gangadharan , R and Rajendran , C . 1993 . Heuristic algorithms for scheduling in the no-wait flowshop . International Journal of Production Economics , 32 ( 3 ) : 285 – 290 .
   Web of Science ®Google Scholar
• Grabowski , J and Pempera , J . 2005 . Some local search algorithms for no-wait flow-shop problem with makespan criterion . Computers & Operations Research , 32 ( 8 ) : 2197 – 2212 .
   Web of Science ®Google Scholar
• Hall , NG and Sriskandarajah , C . 1996 . A survey of machine scheduling problems with blocking and no-wait in process . Operations Research , 44 ( 3 ) : 510 – 525 .
   Web of Science ®Google Scholar
• Hendizadeh , SH , ElMekkawy , TY and Wang , GG . 2007 . Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times . European Journal of Industrial Engineering , 1 ( 4 ) : 391 – 413 .
   Web of Science ®Google Scholar
• King , JR and Spachis , AS . 1980 . Heuristics for flowshop scheduling . International Journal of Production Research , 18 ( 3 ) : 345 – 357 .
   Web of Science ®Google Scholar
• Li , X . 2007 . Influencing factors of job waiting time variance on a single machine . European Journal of Industrial Engineering , 1 ( 1 ) : 56 – 73 .
   Web of Science ®Google Scholar
• Nawaz , M , Enscore , EE Jr and Ham , I . 1983 . A heuristic algorithm for the m machine, n job flowshop sequencing problem . Omega—International Journal of Management Science , 11 ( 1 ) : 91 – 95 .
   Web of Science ®Google Scholar
• Pessan , C , Bouquard , JL and Neron , E . 2008 . An unrelated parallel machines model for an industrial production resetting problem . European Journal of Industrial Engineering , 2 ( 2 ) : 153 – 171 .
   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 ( 5 ) : 177 – 181 .
   Google Scholar
• Rajendran , C . 1994 . A no-wait flowshop scheduling heuristic to minimize makespan . Journal of the Operational Research Society , 45 ( 4 ) : 472 – 478 .
   Web of Science ®Google Scholar
• Reddi , SS and Ramamoorthy , CV . 1972 . On the flowshop sequencing problem with no-wait in process . Operational Research Quarterly , 23 ( 3 ) : 323 – 331 .
   Google Scholar
• Röck , H . 1984a . Some new results in flow shop scheduling . Mathematical Methods of Operations Research , 28 ( 1 ) : 1 – 16 .
   Google Scholar
• Röck , H . 1984b . The three-machine no-wait flow shop is NP-Complete . Journal of the ACM , 31 ( 2 ) : 336 – 345 .
   Web of Science ®Google Scholar
• Ruiz , R and Allahverdi , A . 2007 . No-wait flowshop with separate setup times to minimize maximum lateness . International Journal of Flexible Manufacturing Technology , 35 ( 5/6 ) : 551 – 565 .
   Web of Science ®Google Scholar
• Ruiz , R , Maroto , C and Alcaraz , J . 2006 . Two new robust genetic algorithms for the flowshop scheduling problem . Omega—International Journal of Management Science , 34 ( 5 ) : 461 – 476 .
   Web of Science ®Google Scholar
• Ruiz , R and Stützle , T . 2007 . A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research , 177 ( 3 ) : 2033 – 2049 .
   Web of Science ®Google Scholar
• Ruiz , R and Stützle , T . 2008 . An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives . European Journal of Operational Research , 187 ( 3 ) : 1143 – 1159 .
   Web of Science ®Google Scholar
• Valente , JMS . 2007 . Heuristics for the single machine scheduling problem with early and quadratic tardy penalties . European Journal of Industrial Engineering , 1 ( 4 ) : 431 – 448 .
   Web of Science ®Google Scholar
• Wang , XL and Cheng , TCE . 2006 . A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups . Computers & Operations Research , 33 ( 5 ) : 1326 – 1344 .
   Web of Science ®Google Scholar
• Wismer , DA . 1972 . Solution of the flowshop scheduling problem with no intermediate queues . Operations Research , 20 ( 3 ) : 689 – 697 .
   Web of Science ®Google Scholar
• Yu , X , Ram , B and Jiang , X . 2007 . Parameter setting in a bio-inspired model for dynamic flexible job shop scheduling with sequence-dependent setups . European Journal of Industrial Engineering , 1 ( 2 ) : 182 – 199 .
   Web of Science ®Google Scholar