A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1494-1501

  Naderi, B ^a   Khalili, M ^b   Tavakkoli Moghaddam, R ^c  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b ISLAMIC AZAD UNIVERSITY   (Iran)

^c UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Artificial immune algorithm; Flexible machine availability; Job shop scheduling; Sequence dependent setup times; Total completion time

Indexed keywords

ARTIFICIAL IMMUNE ALGORITHM; FLEXIBLE MACHINE AVAILABILITY; JOB SHOP SCHEDULING; SEQUENCE-DEPENDENT SETUP TIMES; TOTAL COMPLETION TIME;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; PERMANENT MAGNETS; PREVENTIVE MAINTENANCE; SIMULATED ANNEALING;

SCHEDULING ALGORITHMS;

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

References (36)

1. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 (2006) 985-1032
2. Blazewicz J., Breit J., Formanowicz P., Kubiak W., and Schmidt G. Heuristic algorithms for the two-machine flow shop problem with limited machine availability. Omega 29 (2001) 599-608
3. Breit J. A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. Computers and Operations Research 33 (2006) 2143-2153
4. Brucker P., and Thiele O. A branch-and-bound method for general shop problem with sequence-dependent setup times. OR Spectrum 18 (1996) 145-161
5. Cerny V. Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. JOTA 45 (1985) 41-51
6. Cheung W., and Zhou H. Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Annals of Operations Research 107 (2001) 65-81
7. Choi I., and Korkmaz O. Job shop scheduling with separable sequence-dependent setups. Annals of Operations Research 70 (1997) 155-170
8. Coleman B.J. Technical note: A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups. Production and Operations Management 1 (1992) 225-228
9. Debels D., Reyck B.D., Leus R., and Vanhoucke M. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 169 (2006) 633-638
10. Engin O., and Döyen A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Computer Systems 20 (2004) 1083-1095
11. Goldberg D.E. Genetic algorithms in search, optimization and machine learning. Reading (1989), Addison-Wesley, USA
12. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
13. Heinonen J., and Pettersson F. Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Applied Mathematics and Computation 187 (2007) 989-998
14. Holloway C., and Nelson R. Job shop scheduling with due dates and variable processing times. Management Science 20 9 (1974) 1264-1275
15. Huang K.L., and Liao C.J. Ant colony optimization combined with tabu search for the job shop scheduling problem. Computers and Operations Research 35 (2006) 1030-1046
16. Kurz M.E., and Askin R.G. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85 (2003) 371-388
17. Kurz M.E., and Askin R.G. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159 (2004) 66-82
18. Lee C.Y. Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Operations Research Letters 20 (1997) 129-139
19. Monma C.L., and Potts C.N. On the complexity of scheduling with batch setup times. Operations Research 37 (1989) 798-804
20. Montgomery D.C. Design and Analysis of Experiments. 5th ed. (2000), John Wiley & Sons
21. Naderi B., Zandieh M., and Fatemi Ghomi S.M.T. A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance. International Journal of Advanced Manufacturing Technology (2008) 10.1007/s10845-008-0157-6
22. Naderi B., Zandieh M., and Roshanaei V. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. International Journal of Advanced Manufacturing Technology (2008) 10.1007/s00170-008-1569-3
23. Pinedo M. Scheduling Theory, Algorithms, and Systems (1995), Prentice-Hall, Englewood Cliffs, NJ
24. Prakash A., Khilwani N., Tiwari M.K., and Cohen Y. Modified immune algorithm for job selection and operation allocation problem in flexible manufacturing systems. Advances in Engineering Software 39 (2008) 219-232
25. Ruiz R., Garica-Diaz C.J., and Maroto C. Considering scheduling and preventive maintenance in the flow shop sequencing problem. Computers and Operations Research 34 (2007) 3314-3330
26. Ruiz R., Maroto C., and Alcaraz J. Solving the flow shop scheduling problem with sequence dependent setup times using advanced meta-heuristics. European Journal of Operational Research 165 (2005) 34-54
27. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 121 (2000) 1-15
28. Schneider J., Morgensten I., and Singer JM. Bouncing towards the optimum: Improving the results of Mento Carlo optimization algorithms. Physical Review E 58 4 (1998) 5085-5095
29. Sule D.R. Industrial Scheduling (1996), PWS Publishing Company, USA
30. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64 2 (1993) 278-285
31. Tavakkoli-Moghaddam R., Rahimi-Vahed A., and Mirzaei A.H. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness. Information Sciences 177 (2007) 5072-5090
32. Viond V., and Sridharan R. Dynamic job-shop scheduling with sequence-dependent setup times: Simulation modeling and analysis. International Journal of Advanced Manufacturing Technology 36 (2008) 355-372
33. Zandieh M., Fatemi Ghomi S.M.T., and Moattar Husseini S.M. An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180 (2006) 111-127
34. Zhang C.Y., Li P., Rao Y., and Guan Z. A very fast TS/SA algorithm for the job shop scheduling problem. Computers and Operations Research 35 (2008) 282-294
35. Zhou Y., Beizhi Li., and Yang J. Study on job-shop scheduling with sequence-dependent setup times using biological immune algorithm. International Journal of Advanced Manufacturing Technology 30 (2006) 105-111
36. Zhou C., and Egbelu P.G. Scheduling in a manufacturing shop with sequence-dependent setups. Robotics and Computer-Integrated Manufacturing 5 (1989) 73-81