Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time

International Journal of Advanced Manufacturing Technology

Volumn 53, Issue 5-8, 2011, Pages 751-760

  Naderi, Bahman ^a   Ghomi, S M T Fatemi ^a   Aminnayeri, M ^a   Zandieh, M ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Hybrid electromagnetism like metaheuristic; Mixed integer linear programming model; Open shops; Scheduling; Total completion time

Indexed keywords

INDUSTRIAL SETTINGS; METAHEURISTIC; MIXED INTEGER LINEAR PROGRAMMING MODEL; NP-HARD PROBLEM; OPEN SHOP; OPEN SHOP SCHEDULING; OPEN SHOPS; OPTIMALITY; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME; STATISTICAL ANALYSIS; STATISTICAL TOOLS; TOTAL COMPLETION TIME;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTROMAGNETISM; HEURISTIC METHODS; LINEAR PROGRAMMING; SEARCH ENGINES; SIMULATED ANNEALING; STATISTICAL MECHANICS;

INTEGER PROGRAMMING;

EID: 79953066378     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2853-6     Document Type: Article

References (38)

1. Pinedo ML (2008) Theory, algorithms, and systems, 3rd edn. Springer Science+Business Media, New York
2. ME Matta 2009 A genetic algorithm for the proportionate multiprocessor open shop Comput Oper Res 36 2601 2618 2586526 1179.90144 10.1016/j.cor.2008.11. 009
3. CY Liu RL Bulfin 1987 Scheduling ordered open shops Comput Oper Res 14 257 264 885579 0625.90045 10.1016/0305-0548(87)90029-3 (Pubitemid 17567756)
4. C Prins 1994 An overview of scheduling problems arising in satellite communications J Oper Res Soc 40 611 623
5. B Naderi M Zandieh SMT Fatemi Ghomi 2009 Scheduling job shop problems with sequence-dependent setup times Int J Prod Res 47 21 5959 5976 1198.90198 10.1080/00207540802165817
6. RL Graham EL Lawler JK Lenstra AHG Rinnooy Kan 1979 Optimization and approximation in deterministic sequencing and scheduling: a survey Ann Discrete Math 5 287 326 558574 0411.90044 10.1016/S0167-5060(08)70356-X
7. EF Stafford Jr FT Tseng JND Gupta 2005 Comparative evaluation of MILP flowshop models J Oper Res Soc 56 88 101 1122.90359 10.1057/palgrave.jors. 2601805 (Pubitemid 40108433)
8. CH Pan 1997 A study of integer programming formulations for scheduling problems Int J Syst Sci 28 1 33 41 0873.90054 10.1080/00207729708929360
9. CF Liaw 2003 An efficient tabu search approach for the two-machine preemptive open shop scheduling problem Comput Oper Res 30 2081 2095 2007915 1039.90017 10.1016/S0305-0548(02)00124-7 (Pubitemid 37024478)
10. HT Lin HT Lee WJ Pan 2008 Heuristics for scheduling in a no-wait open shop with movable dedicated machines Int J Prod Econ 111 368 377 10.1016/j.ijpe.2007.01.005 (Pubitemid 350299140)
11. C Low Y Yeh 2009 Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated Rob Comput Integr Manuf 23 2 314 322 10.1016/j.rcim.2007.07.017
12. DY Sha CY Hsu 2008 A new particle swarm optimization for the open shop scheduling problem Comput Oper Res 35 10 3243 3261 1133.90017 10.1016/j.cor.2007.02.019 (Pubitemid 351335144)
13. D Debels BD Reyck R Leus M Vanhoucke 2006 A hybrid scatter search/electromagnetism meta-heuristic for project scheduling Eur J Oper Res 169 638 653 1079.90051 10.1016/j.ejor.2004.08.020 (Pubitemid 41375712)
14. I Bïrbïl SC Fang 2003 An electromagnetism-like mechanism for global optimization J Glob Optim 25 263 282 1047.90045 10.1023/A:1022452626305
15. R Tavakkoli-Moghaddam M Khalili B Naderi 2009 A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness Soft Comput 13 995 1006 10.1007/s00500-008-0367-z
16. P Brucker J Hurink B Jurisch BA Wöstmann 1997 A branch and bound algorithm for the open-shop problem Discrete Appl Math 76 43 59 1460565 0882.90066 10.1016/S0166-218X(96)00116-3 (Pubitemid 127414702)
17. CF Liaw 1998 An iterative improvement approach for the nonpreemptive open shop scheduling problem Eur J Oper Res 111 509 517 0937.90032 10.1016/S0377-2217(97)00366-4
18. H Bräsel T Tautenhahn F Werner 1993 Constructive heuristic algorithms for the open shop problem Computing 51 95 110 0796.90031 10.1007/BF02243845
19. C Guéret C Prins 1998 Classical and new heuristics for the open-shop problem: a computational evaluation Eur J Oper Res 107 306 314 0943.90029 10.1016/S0377-2217(97)00332-9 (Pubitemid 128407545)
20. C Guéret C Prin 1999 A new lower bound for the open-shop problem Ann Oper Res 92 165 183 1730743 0958.90033 10.1023/A:1018930613891
21. U Dorndrof E Pesch T Phan-Huy 2001 Solving the open shop scheduling problem J Sched 4 157 174 1999732 10.1002/jos.73 (Pubitemid 33687427)
22. H Bräsel A Herms M Morig T Tautenhahn T Tusch F Werner 2008 Heuristic constructive algorithms for open shop scheduling to minimize mean flow time Eur J Oper Res 189 3 856 870 1146.90406 10.1016/j.ejor.2007.02.057 (Pubitemid 351400581)
23. P Senthilkumar P Shahabudeen 2006 GA based heuristic for the open job shop scheduling problem Int J Adv Manuf Technol 30 297 301 10.1007/s00170-005- 0057-2 (Pubitemid 44180600)
24. B Naderi SMT Fatemi Ghomi M Aminnayeri M Zandieh 2010 A contribution and new heuristics for open shop scheduling Comput Oper Res 137 213 221 2577274 10.1016/j.cor.2009.04.010
25. CF Liaw 2000 A hybrid genetic algorithm for the open shop scheduling problem Eur J Oper Res 124 28 42 1778306 0960.90039 10.1016/S0377-2217(99)00168- X
26. C Prins 2000 Competitive genetic algorithms for the open shop scheduling problem Math methods Oper Res 52 389 411 1810422 1023.90030 10.1007/ s001860000090 (Pubitemid 33675620)
27. M Andresen H Bräsel M Morig J Tusch F Werner P Willenius 2008 Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop Math Comput Modell 48 1279 1293 1187.90127 10.1016/j.mcm.2008.01.002
28. V Roshanaei MM Seyyed Esfehani M Zandieh 2010 Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics Expert Syst Appl 37 259 266 10.1016/j.eswa.2009.05.003
29. B Naderi R Ruiz 2010 The distributed permutation flowshop scheduling problem Comput Oper Res 37 754 768 2586226 1176.90237 10.1016/j.cor.2009.06.019
30. B Naderi R Tavakkoli-Moghaddam M Khalili 2009 Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan Knowl Based Syst 10.1016/j.knosys.2009.06.002
31. J Giffler GL Thompson 1960 Algorithms for solving production scheduling problems Oper Res 8 487 503 113721 0248.90022 10.1287/opre.8.4.487
32. Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs
33. Sule DR (1997) Industrial scheduling. PWS Publishing Company, Boston
34. E Taillard 1993 Benchmarks for basic scheduling problems Eur J Oper Res 64 278 285 0769.90052 10.1016/0377-2217(93)90182-M (Pubitemid 23599340)
35. ME Kurz RG Askin 2004 Scheduling flexible flow lines with sequence dependent setup times Eur J Oper Res 159 66 82 2068746 1067.90045 10.1016/S0377-2217(03)00401-6
36. HM Wagner 1959 An integer linear programming model for machine scheduling Nav Res Logist Q 6 2 131 140 10.1002/nav.3800060205
37. AS Manne 1960 On the job shop scheduling problem Oper Res 8 2 219 223 112747 10.1287/opre.8.2.219
38. B Naderi A Ahmadi Javid F Jolai 2010 Permutation flowshops with transportation times: mathematical models and solution methods Int J Adv Manuf Technol 46 631 647 10.1007/s00170-009-2122-8