{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:22:21Z","timestamp":1780633341499,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10732-020-09444-y","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T18:02:15Z","timestamp":1585591335000},"page":"637-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Heuristic\/meta-heuristic methods for restricted bin packing problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Yu","family":"Fu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amarnath","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"9444_CR1","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1016\/j.tre.2012.06.005","volume":"48","author":"MM Baldi","year":"2012","unstructured":"Baldi, M.M., De Giovanni, L., Perboli, G., Tadei, R.: The generalized bin packing problem. Transp. Res. Part E Logist. Transp. Rev. 48, 1205\u20131220 (2012)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"9444_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0167-6377(83)90042-1","volume":"2","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. Oper. Res. Lett. 2, 80\u201383 (1983)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9444_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1993","unstructured":"Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11\u201324 (1993)","journal-title":"Discrete Appl. Math."},{"key":"9444_CR4","first-page":"41","volume":"3004","author":"B Brugger","year":"2004","unstructured":"Brugger, B., Doerner, K.F., Hartl, R.F., Reimann, M.: Antpacking-an ant colony optimization approach for the one-dimensional bin packing problem. Evolut. Comput. Comb. Optim. 3004, 41\u201350 (2004)","journal-title":"Evolut. Comput. Comb. Optim."},{"key":"9444_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Multidimensional bin packing and other related problems: a survey. Comput. Sci. Rev. 24, 63\u201379 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"9444_CR6","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ic.2006.02.003","volume":"204","author":"G D\u00f3sa","year":"2006","unstructured":"D\u00f3sa, G., He, Y.: Bin packing problems with rejection penalties and their dual problems. Inf. Comput. 204(5), 795\u2013815 (2006)","journal-title":"Inf. Comput."},{"key":"9444_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","volume":"17","author":"S Eilon","year":"1971","unstructured":"Eilon, S., Christofides, N.: The loading problem. Manag. Sci. 17, 259\u2013267 (1971)","journal-title":"Manag. Sci."},{"issue":"1","key":"9444_CR8","first-page":"1","volume":"2","author":"E Falkenauer","year":"2009","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 1\u201324 (2009)","journal-title":"J. Heuristics"},{"key":"9444_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9444_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of grasp\u2014part i: algorithms. Int. Trans. Oper. Res. 16(1), 5\u201330 (2009a)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9444_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of grasp\u2014part ii: applications. Int. Trans. Oper. Res. 16(2), 131\u2013172 (2009b)","journal-title":"Int. Trans. Oper. Res."},{"key":"9444_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0377-2217(95)00010-N","volume":"83","author":"V Gabrel","year":"1995","unstructured":"Gabrel, V.: Scheduling jobs within time windows on identical parallel machines: new model and algorithm. Eur. J. Oper. Res. 83, 230\u2013329 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9444_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Yao, A.C.-C.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory Ser. A 21(3), 257\u2013298 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9444_CR14","doi-asserted-by":"crossref","unstructured":"Henderson, D., Jacobson, S., Johnson, A.: The theory and practice of simulated annealing. In: Handbook of Metaheuristics, Vol. 4, pp. 287\u2013319. Springer, Boston (2006)","DOI":"10.1007\/0-306-48056-5_10"},{"key":"9444_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/nav.3800250209","volume":"25","author":"MS Hung","year":"1978","unstructured":"Hung, M.S., Brown, J.R.: An algorithm for a class of loading problem. Naval Res. Logist. Q. 25, 289\u2013297 (1978)","journal-title":"Naval Res. Logist. Q."},{"key":"9444_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9444_CR17","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S.: Optimization by simulated annealing: quantitative studies. J. Stat. Phys. 34, 975\u2013986 (1984)","journal-title":"J. Stat. Phys."},{"key":"9444_CR18","unstructured":"Korf, R.E.: A new algorithm for optimal bin packing. American Association for Artificial Intelligence 2002 Proceedings, pp. 731\u2013736 (2002)"},{"issue":"2","key":"9444_CR19","first-page":"8","volume":"4","author":"A Layeb","year":"2012","unstructured":"Layeb, A., Chenche, S.: A novel grasp algorithm for solving the bin packing problem. Int. J. Inf. Eng. Electron. Bus. 4(2), 8\u201314 (2012)","journal-title":"Int. J. Inf. Eng. Electron. Bus."},{"key":"9444_CR20","unstructured":"Martello, S., Toth, P.: Bin-packing problem. In: Knapsack Problems: Algorithms and Computer Implementations, pp. 221\u2013 240. Johnwiley & Sons Ltd, New York, (1990a)"},{"key":"9444_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28, 59\u201370 (1990b)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9444_CR22","first-page":"253","volume":"4","author":"S Martello","year":"2010","unstructured":"Martello, S., Toth, P.: Application of genetic algorithm for the bin packing problem with a new representation scheme. Math. Sci. 4(3), 253\u2013266 (2010)","journal-title":"Math. Sci."},{"key":"9444_CR23","doi-asserted-by":"crossref","unstructured":"Zehmakan, A.N.: Bin packing problem: two approximation algorithms. Int. J. Found. Comput. Sci. Technol. 5(4). arXiv preprint arXiv:1508.01376 (2015a)","DOI":"10.5121\/ijfcst.2015.5401"},{"key":"9444_CR24","doi-asserted-by":"crossref","unstructured":"Zehmakan, A.N.: Bin packing problem: a linear constant-space 3\/2-approximation algorithm. Int. J. Found. Comput. Sci. Technol. 5(6). arXiv preprint arXiv:1509.06048 (2015b)","DOI":"10.5121\/ijcsa.2015.5601"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09444-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-020-09444-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09444-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T23:56:03Z","timestamp":1617062163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-020-09444-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9444"],"URL":"https:\/\/doi.org\/10.1007\/s10732-020-09444-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"9 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}