{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T09:20:50Z","timestamp":1689672050963},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,22]],"date-time":"2010-04-22T00:00:00Z","timestamp":1271894400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10732-010-9135-1","type":"journal-article","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T09:58:43Z","timestamp":1271843923000},"page":"281-301","source":"Crossref","is-referenced-by-count":6,"title":["A composite algorithm for multiprocessor scheduling"],"prefix":"10.1007","volume":"17","author":[{"given":"Giuseppe","family":"Paletta","sequence":"first","affiliation":[]},{"given":"Francesca","family":"Vocaturo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,22]]},"reference":[{"key":"9135_CR1","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"A.C.F. Alvim","year":"2004","unstructured":"Alvim, A.C.F., Ribeiro, C.C.: A\u00a0hybrid bin-packing heuristic to multiprocessor scheduling. In: Ribeiro, C.C., Martins, S.L. (eds.) Lecture Notes in Computer Science, vol.\u00a03059, pp.\u00a01\u201313. Springer, Berlin (2004a)"},{"key":"9135_CR2","doi-asserted-by":"crossref","unstructured":"Alvim, A.C.F., Ribeiro, C.C.: A\u00a0hybrid bin-packing heuristic to multiprocessor scheduling: Detailed computational results. http:\/\/www.uniriotec.br\/~adriana\/files\/detPCmaxIN.pdf (2004b)","DOI":"10.1007\/978-3-540-24838-5_1"},{"key":"9135_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A.C.F. Alvim","year":"2004","unstructured":"Alvim, A.C.F., Ribeiro, C.C., Glover,\u00a0F., Aloise, D.J.: A\u00a0hybrid improvement heuristic for the one-dimensional bin packing problem. J.\u00a0Heuristics 10, 205\u2013229 (2004)","journal-title":"J.\u00a0Heuristics"},{"key":"9135_CR4","first-page":"361","volume-title":"Local Search in Combinatorial Optimization","author":"E.J. Anderson","year":"1997","unstructured":"Anderson, E.J., Glass, C.A., Potts, C.N.: Machine scheduling. In: Aarts,\u00a0E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp.\u00a0361\u2013414. Wiley, Chichester (1997)"},{"key":"9135_CR5","first-page":"1","volume":"31","author":"J. Blazewicz","year":"1987","unstructured":"Blazewicz,\u00a0J.: Selected topics in scheduling theory. Ann. Discrete Math. 31, 1\u201360 (1987)","journal-title":"Ann. Discrete Math."},{"key":"9135_CR6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T.C.E. Cheng","year":"1990","unstructured":"Cheng, T.C.E., Sin, C.C.S.: A\u00a0state-of-the-art review of parallel-machine scheduling research. Eur. J. Oper. Res. 47, 271\u2013292 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"9135_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman Jr.","year":"1978","unstructured":"Coffman, E.G. Jr., Garey, M.R., Johnson, D.S.: An application of bin-paking to multiprocessor scheduling. SIAM J. Comput. 7, 1\u201317 (1978)","journal-title":"SIAM J. Comput."},{"key":"9135_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.1070.0246","volume":"20","author":"M. Dell\u2019Amico","year":"2008","unstructured":"Dell\u2019Amico,\u00a0M., Iori,\u00a0M., Martello,\u00a0S., Monaci,\u00a0M.: Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J. Comput. 20, 333\u2013344 (2008)","journal-title":"INFORMS J. Comput."},{"key":"9135_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M. Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico,\u00a0M., Martello,\u00a0S.: Optimal scheduling of tasks on identical parallel processors. ORSA J. Comput. 7, 191\u2013200 (1995)","journal-title":"ORSA J. Comput."},{"key":"9135_CR10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/095372898233687","volume":"9","author":"S.M.T. Fatemi Ghomi","year":"1998","unstructured":"Fatemi Ghomi, S.M.T., Jolai Ghazvini,\u00a0F.: A\u00a0pairwise interchange algorithm for parallel machine scheduling. Prod. Plan. Control 9, 685\u2013689 (1998)","journal-title":"Prod. Plan. Control"},{"key":"9135_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn,\u00a0G., Horowitz,\u00a0E.: A\u00a0linear time approximation algorithm for multiprocessor scheduling. BIT 19, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"9135_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0548(94)90053-1","volume":"21","author":"P.M. Fran\u00e7a","year":"1994","unstructured":"Fran\u00e7a, P.M., Gendreau,\u00a0M., Laporte,\u00a0G., M\u00fcller, F.M.: A\u00a0composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Comput. Oper. Res. 21, 205\u2013210 (1994)","journal-title":"Comput. Oper. Res."},{"key":"9135_CR13","unstructured":"Frangioni,\u00a0A., Necciari,\u00a0E., Scutell\u00e0, M.G.: A\u00a0multi-exchange neighborhood for minimum makespan machine scheduling problems. TR 00-17, Dip. di Informatica, Univ. di\u00a0Pisa (2000)"},{"key":"9135_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/B:JOCO.0000031420.05971.29","volume":"8","author":"A. Frangioni","year":"2004","unstructured":"Frangioni,\u00a0A., Necciari,\u00a0E., Scutell\u00e0, M.G.: A\u00a0multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. J.\u00a0Comb. Optim. 8, 195\u2013220 (2004)","journal-title":"J.\u00a0Comb. Optim."},{"key":"9135_CR15","volume-title":"Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9135_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1009678411503","volume":"3","author":"I.P. Gent","year":"1998","unstructured":"Gent, I.P.: Heuristic solution of open bin packing problems. J.\u00a0Heuristics 3, 299\u2013304 (1998)","journal-title":"J.\u00a0Heuristics"},{"key":"9135_CR17","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech.\u00a0J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech.\u00a0J."},{"key":"9135_CR18","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"9135_CR19","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\u00a0survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9135_CR20","first-page":"181","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"A. Hoogeveen","year":"1997","unstructured":"Hoogeveen,\u00a0A., Lenstra, J.K., Van\u00a0de Velde, S.L.: Sequencing and Scheduling. In: Dell\u2019Amico,\u00a0M., Maffioli,\u00a0F., Martello,\u00a0S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp.\u00a0181\u2013197. Wiley, Chichester (1997)"},{"key":"9135_CR21","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","volume":"21","author":"R. H\u00fcbscher","year":"1994","unstructured":"H\u00fcbscher,\u00a0R., Glover,\u00a0F.: Applying tabu search with influential diversification to multiprocessor scheduling. Comput. Oper. Res. 21, 877\u2013884 (1994)","journal-title":"Comput. Oper. Res."},{"key":"9135_CR22","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BF01934441","volume":"22","author":"M.A. Langston","year":"1982","unstructured":"Langston, M.A.: Improved 0\/1 interchange scheduling. BIT 22, 282\u2013290 (1982)","journal-title":"BIT"},{"key":"9135_CR23","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory. Handbooks in Operations Research and Management Science, vol.\u00a04, pp.\u00a0445\u2013522. Elsevier, Amsterdam (1993)"},{"key":"9135_CR24","first-page":"193","volume":"18","author":"E. Mokotoff","year":"2001","unstructured":"Mokotoff,\u00a0E.: Parallel machine scheduling problems: A\u00a0survey. Asia-Pac. J. Oper. Res. 18, 193\u2013242 (2001)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9135_CR25","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","volume":"152","author":"E. Mokotoff","year":"2004","unstructured":"Mokotoff,\u00a0E.: An exact algorithm for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 152, 758\u2013769 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9135_CR26","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/050634657","volume":"21","author":"G. Paletta","year":"2007","unstructured":"Paletta,\u00a0G., Pietramala,\u00a0P.: A\u00a0new approximation algorithm for the nonpreemptive scheduling of independent jobs on identical parallel processors. SIAM J. Discrete Math. 21, 313\u2013328 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"9135_CR27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009625629722","volume":"4","author":"A. Thesen","year":"1998","unstructured":"Thesen,\u00a0A.: Design and evaluation of tabu search algorithms for multiprocessor scheduling. J.\u00a0Heuristics 4, 141\u2013160 (1998)","journal-title":"J.\u00a0Heuristics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9135-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9135-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9135-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:31Z","timestamp":1559242471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9135-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,22]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9135"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9135-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,22]]}}}