A mixed-integer linear programming model along with an electromagnetism- like algorithm for scheduling job shop production system with sequence-dependent set-up times

International Journal of Advanced Manufacturing Technology

Volumn 47, Issue 5-8, 2010, Pages 783-793

  Roshanaei, Vahid ^a   Balagh, Akram Khaleghei Ghosheh ^b   Esfahani, Mir Mahdi Seyyed ^a   Vahdani, Behnam ^c  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF WINDSOR   (Canada)

^c ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Electromagnetism like algorithm; Job shop Mixed integer linear programming (MILP); Scheduling; Sequence dependent setup times

Indexed keywords

BENCHMARKING; JOB SHOP SCHEDULING; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

ELECTROMAGNETISM-LIKE ALGORITHM; INTEGER LINEAR PROGRAMMING; JOB SHOP MIXED-INTEGER LINEAR PROGRAMMING; JOB-SHOP; LARGE-SIZED; META-HEURISTICS ALGORITHMS; MIXED INTEGER LINEAR; MIXED INTEGER LINEAR PROGRAMMING MODEL; SCHEDULING; SEQUENCE-DEPENDENT SETUP TIME;

INTEGER PROGRAMMING;

EID: 77952247090     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-009-2210-9     Document Type: Article

References (29)

1. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985-1032.
2. Ruiz R, Allahverdi A (2007) Some effective heuristics for no-wait flow shops with setup times to minimize total completion time. Ann Oper Res 156:143-171.
3. Graham RL, Lawler EL, Lenstra JK, Rinnooy kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Discrete Math 5:287-326.
4. Ombuki B, Ventresca M (2004) Local search genetic algorithms for the job shop scheduling problem. Appl Intell 21:99-109.
5. Debels D, Reyck BD, Leus R, Vanhoucke M (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169:638-633.
6. Bïrbïl I, Fang SC (2003) An electromagnetism-like mechanism for global optimization. J Glob Optim 25:263-282l.
7. Coleman BJ (1992) Technical note: a simple model for optimizing the single machine early/tardy problem with sequence-dependent setups. Prod Oper Manag 1:225-228
8. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York.
9. Gupta SK (1986) N jobs and n machines job shop problems with sequence-dependent set-up times. Int J Prod Res 20(5):643-656.
10. Brucker P, Thiele O (1996) A branch-and-bound method for general shop problem with sequence-dependent setup times. OR Spectrum 18:145-161.
11. Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371-388.
12. Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66-82.
13. Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169:781-800.
14. Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. J Appl Math Comput 180:111-127.
15. Zhou C, Egbelu PG (1989) Scheduling in a manufacturing shop with sequence-dependent setups. Robot Comput-Integr Manuf 51:73-81.
16. Satake T, Morikawa K, Takahashi K, Nakamura N (1999) Simulated annealing approach for minimizing the makespan of the general job-shop. Int J Prod Econ 60-61:515-522.
17. Watanabe M, Ida K, Gen M (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job shop scheduling problem. Comput Ind Eng 48:743-752.
18. Goncalves JF, Mendes JJDM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167:77-95.
19. Choi IC, Korkmaz O (1997) Job shop scheduling with separable sequence-dependent setups. Ann Oper Res 70:155-170.
20. Schutten JMJ (1998) Practical job shop scheduling. Ann Oper Res 83:161-178.
21. Sule DR (1997) Industrial scheduling. PWS, Boston.
22. Cheung W, Zhou H (2001) Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Ann Oper Res 107:65-81. (Pubitemid 33634450)
23. Artigues C, Lopez P, Ayache PD (2005) Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis. Ann Oper Res 138:21-52.
24. Viond V, Sridharan R (2006) Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis. Int J Adv ManufTechnol. doi:10.1007/s00170-006-0836-4.
25. Zhou Y, Li B, Yang J (2006) Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm. Int J Adv ManufTechnol 30:105-111.
26. Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of jobshop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Comput Ind Eng 36:343-364.
27. Gen M, Tsujimura Y, Kubota E (1994) Solving job-shop scheduling problem using genetic algorithms. In: Proceedings of the 16th international conference on computer and industrial engineering, Ashikaga, Japan, pp 576-579.
28. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278-285.
29. Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, Hoboken.