An iterated local search algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion

References

• Allahverdi A. et al. A survey of scheduling problems with setup times or costs European Journal of Operation Research 2008 187 3 985 1032
   Web of Science ®Google Scholar
• Jacobs , L. and Brusco , M. 1995 . A local search heuristic for large set-covering problems . Naval Research Logestics , 42 ( 7 ) : 1129 – 1140 .
   Google Scholar
• Jin , Z. , Yang , Z. and Ito , T. 2006 . Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem . International Journal Of Production Economics , 100 : 322 – 334 .
   Web of Science ®Google Scholar
• Khalili , M. and Tavakoli-Moghadam , R. 2011 . A multiobjective electromagnetism algorithm for a bi-objective flowshop scheduling problem . Journal of Manufacturing Systems , doi:10.1016/j.jmsy.2011.08.002
   Web of Science ®Google Scholar
• Kurz , M. and Askin , R. 2003 . Comparing scheduling rules for flexible flow lines . International Journal of Production Economics , 85 : 371 – 388 .
   Web of Science ®Google Scholar
• Kurz , M. and Askin , R. 2004 . Scheduling flexible flow lines with sequence-dependent setup times . European Journal of Operation Research , 159 ( 1 ) : 66 – 82 .
   Web of Science ®Google Scholar
• Naderi B. et al. Multiobjective no-wait flowshop scheduling problems: models and algorithms International Journal of Production Research 2011 doi:10.1080/00207543.2010.543937
   Web of Science ®Google Scholar
• Nawaz , M. , Enscore , E. Jr and Ham , I. 1983 . A heuristic algorithm for the m-machine, n-job flowshop sequencing problem . Omega , 11 ( 1 ) : 91 – 95 .
   Web of Science ®Google Scholar
• Ruiz , R. and Allahverdi , A. 2007 . Some effective heuristics for no-wait flowshops with setup times to minimize total completion time . Annals of Operation Research , 156 : 143 – 171 .
   Web of Science ®Google Scholar
• Zandieh , M. , Ghomi , S. and Husseini , S. 2006 . An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times . Applied Mathematics and Computation , 180 : 111 – 127 .
   Web of Science ®Google Scholar