{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:32:35Z","timestamp":1771979555758,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540220671","type":"print"},{"value":"9783540248385","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_1","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T21:34:14Z","timestamp":1281303254000},"page":"1-13","source":"Crossref","is-referenced-by-count":15,"title":["A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling"],"prefix":"10.1007","author":[{"given":"Adriana C. F.","family":"Alvim","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics (2004) (to appear)","DOI":"10.1023\/B:HEUR.0000026267.44673.ed"},{"key":"1_CR2","unstructured":"Alvim, A.C.F.: Uma heur\u00edstica h\u00edbrida de melhoria para o problema de bin packing e sua aplica\u00e7\u00e3o ao problema de escalonamento de tarefas, Doctorate thesis, Catholic University of Rio de Janeiro, Department of Computer Science, Rio de Janeiro (2003)"},{"key":"1_CR3","first-page":"1","volume-title":"Surveys in Combinatorial Optimization","author":"J. B\u0142a\u017cewicz","year":"1987","unstructured":"B\u0142a\u017cewicz, J.: Selected topics in scheduling theory. In: Laporte, G., Martello, S., Minoux, M., Ribeiro, C.C. (eds.) Surveys in Combinatorial Optimization, pp. 1\u201360. North-Holland, Amsterdam (1987)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J.L. Bruno","year":"1974","unstructured":"Bruno, J.L., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Communications of the ACM\u00a017, 382\u2013387 (1974)","journal-title":"Communications of the ACM"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T. Cheng","year":"1990","unstructured":"Cheng, T., Sin, C.: A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research\u00a047, 271\u2013292 (1990)","journal-title":"European Journal of Operational Research"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman Jr.","year":"1978","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing\u00a07, 1\u201317 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR7","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, M., Martello, S.: Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing\u00a07, 191\u2013200 (1995)","journal-title":"ORSA Journal on Computing"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1080\/095372898233687","volume":"9","author":"S.M. Fatemi-Ghomi","year":"1998","unstructured":"Fatemi-Ghomi, S.M., Jolai-Ghazvini, F.: A pairwise interchange algorithm for parallel machine scheduling. Production Planning and Control\u00a09, 685\u2013689 (1998)","journal-title":"Production Planning and Control"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT\u00a019, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"1_CR10","doi-asserted-by":"publisher","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, M., Laporte, G., M\u00fcller, F.M.: A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Computers Ops. Research\u00a021, 205\u2013210 (1994)","journal-title":"Computers Ops. Research"},{"key":"1_CR11","unstructured":"Frangioni, A., Scutell\u00e0, M.G., Necciari, E.: Multi-exchange algorithms for the minimum makespan machine scheduling problem, Report TR-99-22, Dipartimento di Informatica, Universit\u00e0 di Pisa, Pisa (1999)"},{"key":"1_CR12","unstructured":"Frangioni, A., Necciari, E., Scutell\u00e0, M.G.: A multi-exchange neighborhood for minimum makespan machine scheduling problems. Journal of Combinatorial Optimization (to appear)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/0213013","volume":"13","author":"D.K. Friesen","year":"1984","unstructured":"Friesen, D.K.: Tighter bounds for the MULTIFIT processor scheduling algorithm. SIAM Journal on Computing\u00a013, 170\u2013181 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR14","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. W.H. Freeman, New York (1979)"},{"key":"1_CR15","doi-asserted-by":"publisher","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 Journal of Applied Mathematics\u00a017, 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"1_CR16","doi-asserted-by":"publisher","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. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","volume":"21","author":"R. H\u00fcbscher","year":"1994","unstructured":"H\u00fcbscher, R., Glover, F.: Applying tabu search with influential diversification to multiprocessor scheduling. Computers and Operations Research\u00a021, 877\u2013884 (1994)","journal-title":"Computers and Operations Research"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing\u00a03, 299\u2013325 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory: Handbooks in Operations Research and Management Science","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., Zipkin, P.H., Rinnooy Kan, A.H.G. (eds.) Logistics of Production and Inventory: Handbooks in Operations Research and Management Science, pp. 445\u2013522. North-Holland, Amsterdam (1993)"},{"key":"1_CR21","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"McNaughton","year":"1959","unstructured":"McNaughton: Scheduling with deadlines and loss functions. Management Science\u00a06, 1\u201312 (1959)","journal-title":"Management Science"},{"key":"1_CR23","unstructured":"Necciari, E.: Istances of machine scheduling problems, Online document available at \n                  \n                    http:\/\/www.di.unipi.it\/di\/groups\/optimize\/Data\/MS.html\n                  \n                  \n                 (last visited on November 21, 2001)"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF00127358","volume":"2","author":"A. Scholl","year":"1996","unstructured":"Scholl, A., Voss, S.: Simple assembly line balancing - Heuristic approaches. Journal of Heuristics\u00a02, 217\u2013244 (1996)","journal-title":"Journal of Heuristics"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02216826","volume":"24","author":"M. Yue","year":"1990","unstructured":"Yue, M.: On the exact upper bound for the MULTIFIT processor scheduling algorithm. Annals of Operations Research\u00a024, 233\u2013259 (1990)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:13:21Z","timestamp":1620011601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}