Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem

Computers and Industrial Engineering

Volumn 64, Issue 4, 2013, Pages 902-916

  Arabameri, Sedighe ^a   Salmasi, Nasser ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Metaheuristic algorithms; Mixed integer linear programming; No wait flowshop scheduling; Sequence dependent setup times; Timing algorithm; Weighted earliness and tardiness

Indexed keywords

META HEURISTIC ALGORITHM; MIXED INTEGER LINEAR PROGRAMMING; NO-WAIT FLOWSHOP; SEQUENCE-DEPENDENT SETUP TIME; TIMING ALGORITHMS; WEIGHTED EARLINESS AND TARDINESS;

ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING; TABU SEARCH;

PROBLEM SOLVING;

EID: 84876124890     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2012.12.023     Document Type: Article

References (27)

1. A. Allahverdi, and T. Aldowaisan No-wait flowshops with bi-criteria of makespan and maximum lateness European Journal of Operational Research 152 2004 132 147
2. S.I. Brown, R.G. McGarvey, and J.A. Ventura Total flowtime and makespan for a no-wait m-machine flowshop with setup times The Journal of the Operational Research Society 55 6 2004 614 621
3. P. Dileepan A note on minimizing maximum lateness in a two-machine no-wait flowshop Computers & Operations Research 31 2004 2111 2115 (Pubitemid 38728572)
4. A. Fink, and S. Vob Solving the continuous flowshop scheduling problem by metaheuristics European Journal of Operational Research 151 2003 400 414
5. F. Glover Tabu search-Part I ORSA Journal on Computing 1 1989 190 206
6. F. Glover Tabu search-Part II ORSA Journal on Computing 2 1990 4 32
7. J. Grabowski, and J. Pempera Some local search algorithms for no-wait flowshop problem with makespan criterion Computers & Operations Research 32 2005 2197 2212
8. D. Hajinejad, N. Salmasi, and R. Mokhtari A fast hybrid particle swarm optimization algorithm for flowshop sequence dependent group scheduling problem Scientia Iranica, Transactions E: Industrial Engineering 18 3 2011 759 764
9. N.G. Hall, and C. Sriskandarajah A survey of machine scheduling problems with blocking and no-wait in process Operations Research 44 1996 510 525 (Pubitemid 126669516)
10. Y. Hendel, and F. Sourd An improved earliness-tardiness timing algorithm Computers & Operations Research 34 2007 2931 2938 (Pubitemid 46356730)
11. Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proc. IEEE int. conf neural netw. Piscataway, IEEE (Vol. 4, pp. 1942-1948).
12. D.C. Montgomery Design and analysis of experiments 7th ed. 2009 John Wiley & Sons
13. S. Muthuswamy, C. Mario, V. Gallego, J. Maya, and M. Rojas-Santiago Minimizing makespan in a two-machine no-wait flow shop with batch processing machines International Journal of Advanced Manufacturing Technology 2012 10.1007/s00170-012-3906-9
14. B. Naderi, M. Aminnayeri, M. Piri, and M.H. Ha'iri Yazdi Multi-objective no-wait flowshop scheduling problems: models and algorithms Internatinal Journal of Operation Research 2011 10.1080/00207543.2010.543937
15. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem Computers & Operations Research 35 2008 2807 2839
16. Q.K. Pan, L. Wang, and B. Qian A novel multi-objective particle swarm optimization algorithm for no-wait flowshop scheduling problems Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 222 4 2008 519 539
17. M. Pinedo Scheduling theory 4th ed. Algorithms and systems 2012 Prentice-Hall.
18. R. Poli, K. Kennedy, and T. Blackwell Particle swarm optimization, an overview Swarm Intelligence 1 2007 33 57
19. H. Rock The three-machine no-wait flowshop problem is NP-complete Journal of the Association for Computing Machinery 31 1984 336 345
20. R.J. Ross Taguchi techniques for quality engineering 1989 McGraw-Hill New York
21. N. Salmasi, R. Logendran, and M.R. Skandari Total flow time minimization in a flowshop sequence dependent group scheduling problem Computers & Operations Research 37 2010 199 212
22. W. Szwarc, and S.K. Mukhopadhyay Optimal timing schedules in earliness-tardiness single machine sequencing Naval Research Logistics 42 1995 1109 1114
23. B. Tadayon, and N. Salmasi A two criteria objective function flexible flowshop scheduling problem with machine eligibility constraint International Journal of Advanced Manufacturing Technology 64 2013 1001 1015
24. Tasgetiren, M. F., Liang, Y. C., Sevkli, M., & Gencyilmaz, G. (2004a). Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem. In 4th International symposium on intelligent manufacturing systems (pp. 431-441). Sakarya, Turkey.
25. Tasgetiren, M. F., Sevkli, M., Liang, Y. C., & Cencylmaz, G. (2004b). Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proceeding of the 2004 congress on evolutionary computation (CEC2004), Portland (pp. 1412-1419).
26. X. Wang, and T.C.E. Cheng A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups Computers & Operations Research 33 2006 1326 1344 (Pubitemid 41428294)
27. C. Wang, X. Li, and Q. Wang Accelerated tabu search for no-wait flowshop scheduling problem European Journal of Operational Research 206 2010 64 72