Abstract
This paper addresses the unrelated parallel machine problem with machine and job sequence dependent setup. In this problem, the amount of the setup time does not only depend on the machine and job sequence, but also on a number of resources assigned, which can vary between a minimum and a maximum. The goal is to find a schedule that minimizes the linear combination of the total resources assigned and the total completion time. The problem is NP-hard in the strong sense. The NP-hardness of the problem motivates us to develop a new Iterated Local Search (ILS) heuristic to obtain near-optimal solutions. The heuristic uses an intensification strategy based on the Path Relinking technique which generates new solutions by exploring trajectories that connect high-quality solutions. Computational tests are carried out on a set of benchmark instances and the results obtained by the proposed ILS improve the best known results from the literature by a significant margin.
Chapter PDF
References
Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: Grasp with path relinking for three-index assignment. INFORMS Journal on Computing 17(2), 224–247 (2005)
Dolgui, A., Eremeev, A.V., Kovalyov, M.Y., Kuznetsov, P.M.: Multi-product lot-sizing and scheduling on unrelated parallel machines to minimize makespan. In: Dolgui, A., Lototsky, V.A., Nof, S.Y. (eds.) Proceedings of the 13th IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2009), Moscow, Russia, pp. 832–837. Elsevier Science, Amsterdam (2009)
Fowler, J.W., Horng, S.M., Cochran, J.K.: A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence-dependent setups. International Journal of Industrial Engineering 10, 232–243 (2003)
Glover, F.: Tabu search and adaptive memory programming - advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kenngington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75 (1996)
Guinet, A.: Textile production systems: A succession of non-identical parallel processor shops. Journal of the Operational Research Society 42, 655–671 (1990)
Kim, D.W., Kim, K.H., Jang, W., Chen, F.F.: Unrelated parallel machine sched-uling with setup times using simulated annealing. Robotics and Computer Integrated Manufacturing 18, 223–231 (2002)
Kim, C.O., Shin, H.J.: Scheduling jobs on parallel machines: a restricted tabu search approach. International Journal of Advanced Manufacturing Technology 22, 278–287 (2003)
Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Kochenberger Handbook of metaheuristics, pp. 321–353. Kluwer Academic, Boston (2003)
Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, New Jersey (1995)
Rabadi, G., Moraga, R.J., Al-Salem, A.: Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing 17(1), 85–97 (2006)
Ruiz, R., Andrés, C.: Unrelated parallel machines scheduling with resource-assignable sequence dependent setup times. In: Baptiste, P., Kendall, G., Munier-Kordon, A., Sourd, F. (eds.) Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Paris, France, pp. 439–446 (2007)
Ruiz, R., Stützle, T.: An iterated greedy heuristic for the sequence dependent setup times flow shop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187(3), 1143–1159 (2008)
Weng, M.X., Lu, J., Ren, H.: Unrelated parallel machines scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics 70(3), 215–226 (2001)
Zhu, Z., Heady, R.: Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Computers & Industrial Engineering 38(2), 297–305 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kampke, E.H., Arroyo, J.E.C., Santos, A.G. (2010). Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times. In: Cowling, P., Merz, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2010. Lecture Notes in Computer Science, vol 6022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12139-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12139-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12138-8
Online ISBN: 978-3-642-12139-5
eBook Packages: Computer ScienceComputer Science (R0)