{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:58:12Z","timestamp":1771459092092,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10732-010-9149-8","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T19:46:47Z","timestamp":1289418407000},"page":"637-658","source":"Crossref","is-referenced-by-count":10,"title":["Matching based very large-scale neighborhoods for\u00a0parallel machine scheduling"],"prefix":"10.1007","volume":"17","author":[{"given":"Tobias","family":"Brueggemann","sequence":"first","affiliation":[]},{"given":"Johann L.","family":"Hurink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,11]]},"reference":[{"key":"9149_CR1","unstructured":"Agarwal, R., Ergun, \u00d6., 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"},{"key":"9149_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., \u00d6zlem, E., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123, 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9149_CR3","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J.M. Akker van\u00a0den","year":"1999","unstructured":"van\u00a0den Akker, J.M., Hoogeveen, J.A., van\u00a0de Velde, S.L.: Parallel machine scheduling by column generation. Oper. Res. 47, 862\u2013872 (1999)","journal-title":"Oper. Res."},{"key":"9149_CR4","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1002\/nav.3800200417","volume":"20","author":"K.R. Baker","year":"1973","unstructured":"Baker, K.R., Merten, A.G.: Scheduling with parallel processors and linear delay costs. Nav. Res. Logist. Q. 20, 793\u2013804 (1973)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"9149_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/07408179308964284","volume":"25","author":"J.W. Barnes","year":"1993","unstructured":"Barnes, J.W., Laguna, M.: Solving the multiple-machine weighted flow time problem using tabu search. IIE Trans. 25(2), 121\u2013128 (1993)","journal-title":"IIE Trans."},{"issue":"3","key":"9149_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(92)00176-M","volume":"48","author":"H. Belouadah","year":"1994","unstructured":"Belouadah, H., Potts, C.N.: Scheduling identical parallel machines to minimize total weighted completion time. Discrete Appl. Math. 48(3), 201\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9149_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Berlin (2004)","edition":"4"},{"key":"9149_CR8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00291-006-0052-5","volume":"29","author":"T. Brueggemann","year":"2007","unstructured":"Brueggemann, T., Hurink, J.L.: Two exponential neighborhoods for single machine scheduling. OR Spectrum 29, 513\u2013533 (2007)","journal-title":"OR Spectrum"},{"key":"9149_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z.L. Chen","year":"1999","unstructured":"Chen, Z.L., Powell, W.B.: Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11, 78\u201394 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9149_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R.K. Congram","year":"2002","unstructured":"Congram, R.K., Potts, C.P., van\u00a0de Velde, S.L.: An iterated dynasearch algorithm for the single machine total weighted tardiness problem. INFORMS J. Comput. 14, 52\u201367 (2002)","journal-title":"INFORMS J. Comput."},{"key":"9149_CR11","first-page":"52","volume":"14","author":"V. Deineko","year":"2000","unstructured":"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\u201367 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9149_CR12","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","author":"W.L. Eastman","year":"1964","unstructured":"Eastman, W.L., Even, S., Isaacs, I.M.: Bounds for the optimal scheduling of n jobs on m processors. Manag. Sci. 11, 268\u2013279 (1964)","journal-title":"Manag. Sci."},{"key":"9149_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bureau Stand. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bureau Stand. B"},{"key":"9149_CR14","first-page":"1","volume":"6","author":"S.E. Elmaghraby","year":"1974","unstructured":"Elmaghraby, S.E., Park, S.H.: Scheduling jobs on a number of identical machines. Trans. Am. Inst. Ind. Eng. 6, 1\u201312 (1974)","journal-title":"Trans. Am. Inst. Ind. Eng."},{"key":"9149_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10732-006-5561-5","volume":"12","author":"\u00d6. Ergun","year":"2006","unstructured":"Ergun, \u00d6., Orlin, J.B., Steele-Feldman, A.: Creating very large-scale neighborhoods out of smaller ones by compounding moves. J. Heuristics 12, 115\u2013140 (2006)","journal-title":"J. Heuristics"},{"key":"9149_CR16","unstructured":"Gabow, H.N.: Implementation of algorithms for maximum matching on nonbipartite graphs. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, California (1973)"},{"key":"9149_CR17","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9149_CR18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"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\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9149_CR19","unstructured":"Hoede, C.: Private communication (2006)"},{"key":"9149_CR20","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s002910050098","volume":"21","author":"J. Hurink","year":"1999","unstructured":"Hurink, J.: An exponential neighborhood for a one machine batching problem. OR Spektrum 21, 461\u2013476 (1999)","journal-title":"OR Spektrum"},{"issue":"4","key":"9149_CR21","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T. Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15(4), 1119\u20131129 (1986)","journal-title":"SIAM J. Comput."},{"key":"9149_CR22","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"9149_CR23","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9149_CR24","unstructured":"Potts, C.N., van\u00a0de 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)"},{"key":"9149_CR25","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S.K. Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23, 116\u2013127 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9149_CR26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/moor.25.1.63.15212","volume":"25","author":"M. Skutella","year":"2000","unstructured":"Skutella, M., Woeginger, G.J.: A PTAS for minimizing the total weighted completion time on identical parallel machines. Math. Oper. Res. 25, 63\u201375 (2000)","journal-title":"Math. Oper. Res."},{"key":"9149_CR27","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59\u201366 (1956). Math. Oper. Res. 25, 63\u201375","journal-title":"Nav. Res. Logist. Q."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10732-010-9149-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T16:00:22Z","timestamp":1497888022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9149-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,11]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9149"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9149-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,11]]}}}