An immune-inspired algorithm for an unrelated parallel machines' scheduling problem with sequence and machine dependent setup-times for makespan minimisation

Neurocomputing

Volumn 163, Issue , 2015, Pages 94-105

  Diana, Rodney Oliveira Marinho ^a   de França Filho, Moacir Felizardo ^a   de Souza, Sérgio Ricardo ^a   de Almeida Vitor, João Francisco ^a  

^a CENTRO FEDERAL DE EDUCAÇÃO TECNOLÓGICA DE MINAS GERAIS   (Brazil)

Author keywords

Artificial immune systems; Clonal selection algorithms; Makespan; Scheduling

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS;

ARTIFICIAL IMMUNE SYSTEM; CLONAL SELECTION ALGORITHMS; IMMUNE-INSPIRED ALGORITHMS; LOCAL SEARCH HEURISTICS; MAKESPAN; SEQUENCE-DEPENDENT SETUP TIME; UNRELATED PARALLEL MACHINES; VARIABLE NEIGHBOURHOOD DESCENT;

SCHEDULING;

ARTICLE; ARTIFICIAL IMMUNE SYSTEM; ARTIFICIAL INTELLIGENCE; CLASSIFICATION ALGORITHM; CONTROLLED STUDY; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; IMMUNOLOGICAL MEMORY; INFORMATION SYSTEM; INTERMETHOD COMPARISON; MATHEMATICAL MODEL; PRIORITY JOURNAL; PROBLEM SOLVING; QUALITY CONTROL; SOMATIC HYPERMUTATION; VARIABLE NEIGHBORHOOD DESCENT;

EID: 84930274201     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2014.06.091     Document Type: Article

References (39)

1. Al-Salem A. Scheduling to minimize makespan on unequal parallel machines with sequence dependent setup times. Eng. J. Univ. Qatar 2004, 17(1):177-187.
2. Allahverdi A., Gupta J. A review of scheduling research involving setup considerations. Int. J. Manag. Sci. 1999, 27:219-239.
3. Allahverdi A., Ng C., Cheng T., Kovalyov M.Y. A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 2008, 187:985-1032.
4. Armentano V.A., Franca Filho M.F. Minimizing total tardiness in parallel machine scheduling with setup times. an adaptive memory-based grasp approach. Eur. J. Oper. Res. 2007, 183:100-114.
5. Arnaout J.P., Musa R., Rabadi G. A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines. Part II: enhancements and experimentations. J. Intell. Manuf. 2014, 25(1):43-53.
6. Arnaout J.P., Rabadi G., Musa R. A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf. 2010, 21(1):693-701.
7. L.N. Castro, Engenharia imunológica: desenvolvimento e aplicação de ferramentas computacionais inspiradas em sistemas imunológicos artificiais (in portuguese) (Ph.D. thesis), Universidade Estadual de Campinas, Campinas - SP, 2001.
8. L.N. Castro, J. Timmis, An artificial immune network for multimodal function optimization, in: Proceedings of IEEE World Congress on Evolutionary Computation, 2002, pp. 669-674.
9. L.N. Castro, F.J. von Zuben, The clonal selection algorithm with engineering applications, in: Workshop Proceedings of GECCO, vol. 1, 2000, pp. 36-37.
10. Clarke G., Wright J.R. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 1964, 12:568-581.
11. E.B. de Lima, G.L. Pappa, J.M. de Almeida, M.A. Gonçalves, W.M. Junior, Tuning genetic programming parameters with factorial designs, in: IEEE Congress on Evolutionary Computation, CEC, 2010.
12. de Paula M.R., Ravetti M.G., Mateus G.R., Pardalos P.M. Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J. Manag. Math. 2007, 18:101-115.
13. Feo T.A., Resende M.G.C. Greedy randomized adaptive search procedures. J. Glob. Optim. 1995, 9:849-859.
14. França P.M., Gendreau M., Laporte G., Muller F.M. A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Int. J. Prod. Econ. 1996, 43:79-89.
15. Gendreau M., Laporte G., Guimaraes E.M. A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 2001, 133:183-189.
16. Guinet A. Textile production systems. a succession of non-identical parallel processor shops. J. Oper. Res. Soc. 1991, 42(8):655-671.
17. Guinet A. Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. Int. J. Prod. Res. 1993, 31:1579-1594.
18. Hariri A.M.A., Potts C.N. Heuristics for scheduling unrelated parallel machines. Comput. Oper. Res. 1991, 18:323-331.
19. Helal R.M., Al-Salem A. A tabu search algorithm to minimize the makespan for unrelated parallel machines scheduling problem with setup times. Int. J. Oper. Res. 2006, 3:182-192.
20. Kim D.-W., Kim K.-H., Jang W., Chen F.F. Unrelated parallel machine scheduling with setup times using simulated annealing. Robot. Comput. Integr. Manuf. 2002, 18:223-231.
21. Kim D.-W., Na D.-G., Chen F.F. Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot. Comput. Integr. Manuf. 2003, 19:173-181.
22. Kurz M.E., Askin R.G. Heuristic scheduling of parallel machines with sequence-dependent setup times. Int. J. Prod. Res. 2001, 39:3747-3769.
23. Lancia G. Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. Eur. J. Oper. Res. 2000, 120:277-288.
24. Liaw C.-F., Lin Y.-K., Cheng C.-Y., Chen M. Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput. Oper. Res. 2003, 30:1777-1789.
25. Manne A.S. On the jobshop scheduling problem. Oper. Res. 1960, 8:219-230.
26. Martello S., Soumis F., Toth P. Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Appl. Math. 1997, 75:169-188.
27. Mladenovic N., Hansen P. Variable neighborhood search. Comput. Oper. Res. 1997, 24:1097-1100.
28. Montgomery D.C. Desing and Analysis of Experiments 2001, John Wiley and Sons, New York. 5th Edition.
29. Parker R.G., Deana R.H., Holmes R.A. On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent changeover costs. AIIE Trans. 1977, 9:155-160.
30. Pinedo M. Scheduling: Theory, Algorithms and Systems 2008, Prentice Hall, New York. 3rd Edition.
31. G. Rabadi, Scheduling research virtual center, http://schedulingresearch.com, 2008 (accessed 30.04.2012). http://schedulingresearch.com.
32. Rabadi G., Moraga R., Al-Salem A. Heuristics for the unrelated parallel machine scheduling problem with setup times. J. Intell. Manuf. 2006, 17:85-97.
33. Rocha P.L., Ravetti M.G., Mateus G.R., Pardalos P.M. Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput. Oper. Res. 2008, 35:1250-1264.
34. R. Ruiz, SOA-Sistemas de Optimización Aplicada. URL , 2012 (accessed 30.10.2012). http://soa.iti.es/problem-instances.
35. Ruiz R., Andres C. Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. J. Intell. Manuf. 2011, 57:777-794.
36. Ulutas B.H., Kulturel-Konak S. A review of clonal selection algorithm and its applications. Artif. Intell. Rev. 2011, 36(2):117-138.
37. Vallada E., Ruiz R. A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 2011, 211:612-622.
38. Wagner H.W. An integer linear-programming model for machine scheduling. Nav. Res. Logist. Q. 1959, 6:31-40.
39. Ying K.-C., Lee Z.-J., Lin S.-W. Makespan minimization for scheduling unrelated parallel machines with setup times. J. Intell. Manuf. 2012, 23:1795-1803.