A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches

Applied Soft Computing Journal

Volumn 50, Issue , 2017, Pages 109-123

  Afzalirad, Mojtaba ^a   Rezaeian, Javad ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

Author keywords

Machine eligibility restrictions; Multi objective ant colony optimization; Non dominated sorting genetic algorithm; Precedence constraints; Unrelated parallel machine scheduling

Indexed keywords

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; INTEGER PROGRAMMING; MACHINERY; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; SCHEDULING; SHIPS; SHIPYARDS; TAGUCHI METHODS;

MACHINE ELIGIBILITY RESTRICTIONS; MULTI OBJECTIVE; NON- DOMINATED SORTING GENETIC ALGORITHMS; PRECEDENCE CONSTRAINTS; UNRELATED PARALLEL MACHINES;

PROBLEM SOLVING;

EID: 84999027918     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2016.10.039     Document Type: Article

References (46)

1. [1] Tavakkoli-Moghaddam, R., Taheri, F., Bazzazi, M., Izadi, M., Sassani, F., Design of a genetic algorithm for bi objective unrelated parallel machines scheduling with sequence dependent setup times and precedence constraints. Comput. Oper. Res. 36 (2009), 3224–3230.
2. [2] Hurink, J., Knust, S., List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett. 29 (2001), 231–239.
3. [3] Gacias, B., Artigues, C., Lopez, P., Parallel machine scheduling with precedence constraints and setup times. Comput. Oper. Res. 37 (2010), 2141–2151.
4. [4] Driessel, R., Monch, L., Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Comput. Ind. Eng. 61 (2011), 336–345.
5. [5] Cakar, T., Koker, R., Sari, Y., Parallel robot scheduling to minimize mean tardiness with unequal release date and precedence constraints using a hybrid intelligent system. Int. J. Adv. Rob. Syst. 9 (2012), 1–13.
6. [6] Bilyk, A., Monch, L., Almeder, C., Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. Comput. Ind. Eng. 78 (2014), 175–185.
7. [7] Centeno, G., Armacost, R.L., Parallel machine scheduling with release time and machine eligibility restrictions. Comput. Ind. Eng. 33 (1997), 273–276.
8. [8] Centeno, G., Armacost, R.L., Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int. J. Prod. Res. 42 (2004), 1243–1256.
9. [9] Liao, L.W., Sheen, G.J., Parallel machine scheduling with machine availability and eligibility constraints. Eur. J. Oper. Res. 184 (2008), 458–467.
10. [10] Sheen, G.J., Liao, L.W., Lin, C.F., Optimal parallel machines scheduling with machine availability and eligibility constraints. Int. J. Adv. Manuf. Technol. 36 (2008), 132–139.
11. [11] Gokhale, R., Mathirajan, M., Scheduling identical parallel machines with machine eligibility restrictions to minimize total weighted flowtime in automobile gear manufacturing. Int. J. Adv. Manuf. Technol. 60 (2012), 1099–1110.
12. [12] Wang, I.L., Wang, Y.C., Chen, C.W., Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics. Flexible Serv. Manuf. J. 25 (2013), 343–366.
13. [13] Rambod, M., Rezaeian, J., Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictions. Comput. Ind. Eng. 77 (2014), 15–28.
14. [14] Hu, X., Bao, J.S., Jin, Y., Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions. Int. J. Prod. Res. 48 (2010), 1639–1651.
15. [15] Cochran, J.K., Horng, S.M., Fowler, J.W., A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers and Operations Research 30 (2003), 1087–1102.
16. [16] Chyu, C.C., Chang, W.S., A Pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems. Int. J. Adv. Manuf. Technol. 49 (2010), 697–708.
17. [17] Gao, J., A novel artificial immune system for solving multi-objective scheduling problems subject to special process constraint. Comput. Ind. Eng. 58 (2010), 602–609.
18. [18] Fang, K.T., Lin, B.M.T., Parallel-machine scheduling to minimize tardiness penalty and power cost. Comput. Ind. Eng. 64 (2013), 224–234.
19. [19] Berrichi, A., Yalaoui, F., Amodeo, L., Mezghiche, M., Bi-objective ant colony optimization approach to optimize production and maintenance scheduling. Comput. Oper. Res. 37 (2010), 1584–1596.
20. [20] Behnamian, J., Zandieh, M., Fatemi Ghomi, S.M.T., Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid met-heuristics and weighted min–max technique. Soft Comput. 15 (2011), 1313–1331.
21. [21] Bandyopadhyay, S., Bhattacharya, R., Solving multi-objective parallel machine scheduling problem by a modified NSGA-II. Appl. Math. Modell. 37 (2013), 6718–6729.
22. [22] Torabi, S.A., Sahebjamnia, N., Mansouri, S.A., Aramon Bajestani, M., A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem. Appl. Soft Comput. 13 (2013), 4750–4762.
23. [23] Wang, S., Liu, M., Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning. J. Manuf. Syst., 2015, 10.1016/j.jmsy.2015.07.002.
24. [24] Rostami, M., Pilerood, A.E., Mazdeh, M.M., Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment. Comput. Ind. Eng. 85 (2015), 206–215.
25. [25] Zarandi, M.F., Kayvanfar, V., A bi-objective identical parallel machine scheduling problem with controllable processing times: a just-in-time approach. Int. J. Adv. Manuf. Technol. 77 (2015), 545–563.
26. [26] Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979), 287–326.
27. [27] Lee, J.K., Lee, K.J., Park, H.K., Hong, J.S., Lee, J.S., Developing scheduling systems for daewoo shipbuilding: DAS project. Eur. J. Oper. Res. 97 (1997), 380–395.
28. [28] Dorigo, M., Optimization, Learning and Natural Algorithms, PhD thesis. 1992, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy.
29. [29] Dorigo, M., Maniezzo, V., Colorni, A., Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B Cybern. 26 (1996), 29–41.
30. [30] Dorigo, M., Gambardella, L.M., A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1 (1997), 53–66.
31. [31] Dorigo, M., Caro, G.D., Gambardella, L.M., Ant algorithms for discrete optimization. Artif. Life 5 (1999), 137–172.
32. [32] Stützle, T., H-Hoos, H., MAX–MIN ant system. Future Gen. Comput. Syst. 16 (2000), 889–914.
33. [33] Ghoseiri, K., Nadjari, B., An ant colony optimization algorithm for the bi-objective shortest path problem. Appl. Soft Comput. 10 (2010), 1237–1246.
34. [34] Iredi, S., Merkle, D., Middendorf, M., Bi-criterion optimization with multi colony ant algorithms. First International Conference on Evolutionary Multi-criterion Optimization, 2001, 359–372.
35. [35] T'kindt, V., Monmarche, N., Tercinet, F., Laugt, D., An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142 (2002), 250–257.
36. [36] Doener, K., Hartl, R.F., Teimann, M., Are COMPET ants more competent for problem solving?—The case of full truck load transportation. Central Eur. J. Oper. Res. 11 (2003), 115–141.
37. [37] Doerner, K., Gutjahr, W.J., Hartl, R.F., Strauss, C., Stummer, C., Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann. Oper. Res. 131 (2004), 79–99.
38. [38] Yagmahan, B., Yenisey, M.M., A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst. Appl. 37 (2010), 1361–1368.
39. [39] Rada-Vilela, J., Chica, M., Cordón, Ó., Damas, S., A comparative study of multi-objective ant colony optimization algorithms for the time and space assembly line balancing problem. Appl. Soft Comput. 13 (2013), 4370–4382.
40. [40] Farhanchi, M., Hassanzadeh, R., Mahdavi, I., Mahdavi-Amiri, N., A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes. Appl. Soft Comput. 21 (2014), 491–500.
41. [41] Garcia-Martinez, C., Cordon, O., Herrera, F., A taxonomy and empirical analysis of multiple objective ant colony optimization algorithm for the bi-criteria TSP. Eur. J. Oper. Res. 180 (2007), 116–148.
42. [42] Keskinturk, T., Yildirim, M.B., Barut, M., An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times. Comput. Oper. Res. 39 (2012), 1225–1235.
43. [43] Dorigo, M., Stützle, T., Ant Colony Optimization. 2004, MIT, Press, Cambridge.
44. [44] Deb, K., Agrawal, S., Pratap, A., Meyarivan, T., A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6 (2000), 182–197.
45. [45] Radhakrishnan, S., Ventura, J.A., Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence dependent set-up times. Int. J. Prod. Res. 38 (2000), 2233–2252.
46. [46] Taguchi, G., Introduction to Quality Engineering, 1th Ed University of California. 1986, The Organization.