Abstract
In this paper we study very large-scale neighborhoods for the minimum total weighted completion time problem on parallel machines, which is known to be strongly \(\mathcal{NP}\)-hard. We develop two different ideas leading to very large-scale neighborhoods in which the best improving neighbor can be determined by calculating a weighted matching. The first neighborhood is introduced in a general fashion using combined operations of a basic neighborhood. Several examples for basic neighborhoods are given. The second approach is based on a partitioning of the job sets on the machines and a reassignment of them. In a computational study we evaluate the possibilities and the limitations of the presented very large-scale neighborhoods.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Agarwal, R., Ergun, Ö., Orlin, J.B., Potts, C.N.: Solving parallel machine scheduling problems with very-large scale neighborhood search. Working paper (2007). http://www2.isye.gatech.edu/~oergun/publications/ParallelMachineJOS.pdf, J. Sched., to appear
Ahuja, R.K., Özlem, E., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123, 75–102 (2002)
van den Akker, J.M., Hoogeveen, J.A., van de Velde, S.L.: Parallel machine scheduling by column generation. Oper. Res. 47, 862–872 (1999)
Baker, K.R., Merten, A.G.: Scheduling with parallel processors and linear delay costs. Nav. Res. Logist. Q. 20, 793–804 (1973)
Barnes, J.W., Laguna, M.: Solving the multiple-machine weighted flow time problem using tabu search. IIE Trans. 25(2), 121–128 (1993)
Belouadah, H., Potts, C.N.: Scheduling identical parallel machines to minimize total weighted completion time. Discrete Appl. Math. 48(3), 201–218 (1994)
Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Berlin (2004)
Brueggemann, T., Hurink, J.L.: Two exponential neighborhoods for single machine scheduling. OR Spectrum 29, 513–533 (2007)
Chen, Z.L., Powell, W.B.: Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11, 78–94 (1999)
Congram, R.K., Potts, C.P., van de Velde, S.L.: An iterated dynasearch algorithm for the single machine total weighted tardiness problem. INFORMS J. Comput. 14, 52–67 (2002)
Deineko, V., Woeginger, G.J.: A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem. INFORMS J. Comput. 14, 52–67 (2000)
Eastman, W.L., Even, S., Isaacs, I.M.: Bounds for the optimal scheduling of n jobs on m processors. Manag. Sci. 11, 268–279 (1964)
Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bureau Stand. B 69, 125–130 (1965)
Elmaghraby, S.E., Park, S.H.: Scheduling jobs on a number of identical machines. Trans. Am. Inst. Ind. Eng. 6, 1–12 (1974)
Ergun, Ö., Orlin, J.B., Steele-Feldman, A.: Creating very large-scale neighborhoods out of smaller ones by compounding moves. J. Heuristics 12, 115–140 (2006)
Gabow, H.N.: Implementation of algorithms for maximum matching on nonbipartite graphs. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, California (1973)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)
Hoede, C.: Private communication (2006)
Hurink, J.: An exponential neighborhood for a one machine batching problem. OR Spektrum 21, 461–476 (1999)
Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15(4), 1119–1129 (1986)
Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)
Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343–362 (1977)
Potts, C.N., van de Velde, S.L.: Dynasearch-iterative local improvement by dynamic programming: Part 1. The traveling salesman problem. Technical Report, University of Twente, Enschede, The Netherlands (1995)
Sahni, S.K.: Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23, 116–127 (1976)
Skutella, M., Woeginger, G.J.: A PTAS for minimizing the total weighted completion time on identical parallel machines. Math. Oper. Res. 25, 63–75 (2000)
Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59–66 (1956). Math. Oper. Res. 25, 63–75
Author information
Authors and Affiliations
Corresponding author
Additional information
T. Brueggemann was supported by the Netherlands Organization for Scientific Research (NWO) grant 613.000.225 (Local Search with Exponential Neighborhoods).
J.L. Hurink was supported by BSIK grant 03018 (BRICKS: Basic Research in Informatics for Creating the Knowledge Society).
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Brueggemann, T., Hurink, J.L. Matching based very large-scale neighborhoods for parallel machine scheduling. J Heuristics 17, 637–658 (2011). https://doi.org/10.1007/s10732-010-9149-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-010-9149-8