{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:45:26Z","timestamp":1782834326074,"version":"3.54.5"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02085642","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T11:22:06Z","timestamp":1124018526000},"page":"239-261","source":"Crossref","is-referenced-by-count":27,"title":["Multiple-type, two-dimensional bin packing problems: Applications and algorithms"],"prefix":"10.1007","volume":"50","author":[{"given":"Bernard T.","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Diehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack S.","family":"Cook","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02085642_CR1","doi-asserted-by":"crossref","unstructured":"E.H.L. Aarts and J. Korst,Simulated Annealing and Boltzmann Machines (Wiley, 1989).","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"BF02085642_CR2","first-page":"193","volume":"40","author":"E.H.L. Aarts","year":"1985","unstructured":"E.H.L. Aarts and P.J.M. van Laarhoven, Statistical cooling: A general approach to combinatorial problems, Phillips J. Res. 40(1985)193\u2013226.","journal-title":"Phillips J. Res."},{"key":"BF02085642_CR3","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974) chapter 10."},{"key":"BF02085642_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-3125-1","volume-title":"Industrial Robot Applications","author":"E. Appleton","year":"1987","unstructured":"E. Appleton and D.J. Williams,Industrial Robot Applications (Wiley, New York, 1987) chapter 3."},{"key":"BF02085642_CR5","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"B.S. Baker, E.G. Coffman and R.L. Rivest, Orthogonal packings in two dimensions, SIAM J. Comp. 9(1980)846\u2013855.","journal-title":"SIAM J. Comp."},{"key":"BF02085642_CR6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"B.S. Baker","year":"1981","unstructured":"B.S. Baker, D.J. Brown and H.P. Katseff, A 5\/4 algorithm for two-dimensional bin packing, J. Algor. 2(1981)348\u2013368.","journal-title":"J. Algor."},{"key":"BF02085642_CR7","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"B.S. Baker","year":"1983","unstructured":"B.S. Baker and J.S. Schwarz, Shelf algorithms for two-dimensional packing problems, SIAM J. Comp. 12(1983)508\u2013525.","journal-title":"SIAM J. Comp."},{"key":"BF02085642_CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230110210","volume":"11","author":"M. Ball","year":"1981","unstructured":"M. Ball and M. Magazine, The design and analysis of heuristics, Networks 11(1981)215\u2013219.","journal-title":"Networks"},{"key":"BF02085642_CR9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6377(89)90026-6","volume":"8","author":"J.J. Bartholdi III","year":"1989","unstructured":"J.J. Bartholdi III, J.H. Vande Vate and J. Zhang, Expected performance of the shelf heuristic for 2-dimensional packing, Oper. Res. Lett. 8(1989)11\u201316.","journal-title":"Oper. Res. Lett."},{"key":"BF02085642_CR10","unstructured":"S.P. Bradley, A.C. Hax and T.L. Magnanti,Applied Mathematical Programming (Addison-Wesley, 1977) chapter 12."},{"key":"BF02085642_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF00264439","volume":"18","author":"D.J. Brown","year":"1982","unstructured":"D.J. Brown, B.S. Baker and H.P. Katseff, Lower bounds for on-line two-dimensional packing algorithms, Acta Inf. 18(1982)207\u2013225.","journal-title":"Acta Inf."},{"key":"BF02085642_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"F.R.K. Chung","year":"1982","unstructured":"F.R.K. Chung, M.R. Garey and D.S. Johnson, On packing two-dimensional bins, SIAM J. Alg. Discr. Methods 3(1982)66\u201376.","journal-title":"SIAM J. Alg. Discr. Methods"},{"key":"BF02085642_CR13","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"C-32","author":"B. Chazelle","year":"1983","unstructured":"B. Chazelle, The bottom-left bin-packing heuristic: An efficient implementation, IEEE Trans. Comp. C-32(1983)697\u2013707.","journal-title":"IEEE Trans. Comp."},{"key":"BF02085642_CR14","unstructured":"E.G. Codd, Multiprogramming scheduling, Commun. ACM, Parts 1 and 2(1960)347\u2013350; Parts 3 and 4 (1960) 413\u2013418."},{"key":"BF02085642_CR15","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman","year":"1980","unstructured":"E.G. Coffman, M.R. Garey, D.S. Johnson and R.E. Tarjan, Performance bounds for level-oriented two-dimensional packing algorithms, SIAM J. Comp. 9(1980)808\u2013826.","journal-title":"SIAM J. Comp."},{"key":"BF02085642_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-7091-4338-4_3","volume-title":"Algorithm Design for Computer System Design","author":"E.G. Coffman","year":"1984","unstructured":"E.G. Coffman, M.R. Garey and D.S. Johnson, Approximation algorithms for bin-packing \u2014 an updated survey, in:Algorithm Design for Computer System Design, ed. G. Ausiello, M. Luccertini and P. Serafini (Springer, Vienna, 1984) pp. 49\u2013106."},{"key":"BF02085642_CR17","doi-asserted-by":"crossref","unstructured":"J. Cook and B.T. Han, Optimal robot selection and work station assignment for a CIM system, IEEE Trans. Robotics and Automation (February, 1994), to appear.","DOI":"10.1109\/70.282545"},{"key":"BF02085642_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","volume":"8","author":"D. Coppersmith","year":"1989","unstructured":"D. Coppersmith and P. Raghavan, Multidimensional on-line bin packing: algorithms and worst-case analysis, Oper. Res. Lett. 8(1989)17\u201320.","journal-title":"Oper. Res. Lett."},{"key":"BF02085642_CR19","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G. Cornejols","year":"1991","unstructured":"G. Cornejols, R. Sridharan and J.M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, Eur. J. Oper. Res. 50(1991)280\u2013297.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02085642_CR20","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K.A. Dowsland","year":"1992","unstructured":"K.A. Dowsland and W.B. Dowsland, Packing problems, Eur. J. Oper. Res. 56(1992)2\u201314.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02085642_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, The Lagrangian relaxation method for solving integer programming problem, Manag. Sci. 27(1981)1\u201318.","journal-title":"Manag. Sci."},{"key":"BF02085642_CR22","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1+\u03b5 in linear time, Combinatorica 1(1981)349\u2013355.","journal-title":"Combinatorica"},{"key":"BF02085642_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, R.L. Graham, D.S. Johnson and A.C.C. Yao, Resource constrained scheduling as generalized bin packing, J. Comb. Theory (A) 21(1976)257\u2013298.","journal-title":"J. Comb. Theory (A)"},{"key":"BF02085642_CR24","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B. Gavish","year":"1985","unstructured":"B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Math. Progr. 31(1985)78\u2013105.","journal-title":"Math. Progr."},{"key":"BF02085642_CR25","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"A. Geoffrion","year":"1978","unstructured":"A. Geoffrion and R. McBride, Lagrangian relaxation applied to capacitated facility location problems, AIIE Trans. 10(1978)40\u201347.","journal-title":"AIIE Trans."},{"key":"BF02085642_CR26","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting-stock problem, Oper. Res. 9(1961)849\u2013859.","journal-title":"Oper. Res."},{"key":"BF02085642_CR27","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1963","unstructured":"P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting-stock problem-Part II, Oper. Res. 11(1963)863\u2013888.","journal-title":"Oper. Res."},{"key":"BF02085642_CR28","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P.C. Gilmore","year":"1965","unstructured":"P.C. Gilmore and R.E. Gomory, Multistage cutting stock problems of two and more dimensions, Oper. Res. 13(1965)94\u2013120.","journal-title":"Oper. Res."},{"key":"BF02085642_CR29","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search: a tutorial, Interfaces 20(1990)74\u201394.","journal-title":"Interfaces"},{"key":"BF02085642_CR30","unstructured":"F. Glover and R. Hubscher, Bin packing with tabu search, Graduate School of Business and Administration, University of Colorado at Boulder (1991)."},{"key":"BF02085642_CR31","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"I. Golan","year":"1981","unstructured":"I. Golan, Performance bounds for orthogonal oriented two-dimensional packing algorithms, SIAM J. Comp. 10(1981)571\u2013582.","journal-title":"SIAM J. Comp."},{"key":"BF02085642_CR32","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(92)90362-D","volume":"61","author":"B.T. Han","year":"1992","unstructured":"B.T. Han and G. Diehr, An algorithm for device selection and file assignment, Eur. J. Oper. Res. 61(1992)326\u2013344.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02085642_CR33","unstructured":"B.T. Han, Optimal file management for a storage system using magnetic and optical disks, Inf. Dec. Technol., to appear."},{"key":"BF02085642_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(80)90817-7","volume":"45","author":"M. Hofri","year":"1980","unstructured":"M. Hofri, Two-dimensional packing: Expected performance of simple level algorithms, Inf. Control 45(1980)1\u201317.","journal-title":"Inf. Control"},{"key":"BF02085642_CR35","unstructured":"W.H. Inmon, EIS and data warehouse, Database Progr. Design (November, 1992)70\u201373."},{"key":"BF02085642_CR36","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, Fast algorithms for bin packing, J. Comp. Syst. Sci. 8(1974)272\u2013314.","journal-title":"J. Comp. Syst. Sci."},{"key":"BF02085642_CR37","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimazion by simulated annealing: An experimental evaluation: Part I, Graph partitioning, Oper. Res. 37(1989)865\u2013892.","journal-title":"Oper. Res."},{"key":"BF02085642_CR38","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part II, Graph coloring and number partitioning, Oper. Res. 39(1991)378\u2013406.","journal-title":"Oper. Res."},{"key":"BF02085642_CR39","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02283751","volume":"16","author":"T. Kampke","year":"1988","unstructured":"T. Kampke, Simulated annealing: Use of a new tool in bin packing, Ann Oper. Res. 16(1988)327\u2013332.","journal-title":"Ann Oper. Res."},{"key":"BF02085642_CR40","volume-title":"The differential method of set partitioning, Report UCB\/CSD 82\/113","author":"N. Karmarkar","year":"1982","unstructured":"N. Karmarkar and r.M. Karp, The differential method of set partitioning, Report UCB\/CSD 82\/113, Computer Science Division, University of California, Berkeley, California 94720 (1982)."},{"key":"BF02085642_CR41","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671\u2013680.","journal-title":"Science"},{"key":"BF02085642_CR42","unstructured":"B. O'Connell, Reinventing data management, DEC Professional (February, 1993)40\u201345."},{"key":"BF02085642_CR43","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1287\/moor.16.3.490","volume":"16","author":"W.T. Rhee","year":"1991","unstructured":"W.T. Rhee and M. Talagrand, Multidimensional optimal bin packing with items of random size, Math. Oper. Res. 16(1991)490\u2013503.","journal-title":"Math. Oper. Res."},{"key":"BF02085642_CR44","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1080\/07408178408974686","volume":"16","author":"S.C. Sarin","year":"1984","unstructured":"S.C. Sarin and W.E. Wilhelm, Prototype models for two-dimensional layout design of robot systems, IIE Trans. 16(1984)206\u2013215.","journal-title":"IIE Trans."},{"key":"BF02085642_CR45","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(80)90121-0","volume":"10","author":"D. Sleator","year":"1980","unstructured":"D. Sleator, A 2.5 times optimal algorithm for packing in two dimensions, Inf. Proc. Lett. 10(1980)37\u201340.","journal-title":"Inf. Proc. Lett."},{"key":"BF02085642_CR46","volume-title":"Computer and Job-shop Scheduling Theory","author":"J.D. Ullman","year":"1975","unstructured":"J.D. Ullman, Complexity of sequencing problems, in:Computer and Job-shop Scheduling Theory, ed. E.G. Coffman, Jr. (Wiley, New York, 1975)."},{"key":"BF02085642_CR47","volume-title":"Theoretical and Computational Aspects of Simulated Annealing","author":"P.J.M. Laarhoven van","year":"1988","unstructured":"P.J.M. van Laarhoven,Theoretical and Computational Aspects of Simulated Annealing, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands (1988)."},{"key":"BF02085642_CR48","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Laarhoven van","year":"1988","unstructured":"P.J.M. van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (Kluwer Academic, Boston, MA, 1988)."},{"key":"BF02085642_CR49","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"A.C.C. Yao, New algorithms for bin packing, J. ACM 27(1980)207\u2013227.","journal-title":"J. ACM"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085642.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02085642\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:48:06Z","timestamp":1586393286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02085642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02085642"],"URL":"https:\/\/doi.org\/10.1007\/bf02085642","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}