{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:50Z","timestamp":1777965770250,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T00:00:00Z","timestamp":1199491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s10878-007-9125-x","type":"journal-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T15:26:53Z","timestamp":1199460413000},"page":"417-423","source":"Crossref","is-referenced-by-count":34,"title":["A note on online strip packing"],"prefix":"10.1007","volume":"17","author":[{"given":"Deshi","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,5]]},"reference":[{"issue":"3","key":"9125_CR1","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"BS Baker","year":"1983","unstructured":"Baker BS, Schwarz JS (1983) Shelf algorithms for two-dimensional packing problems. SIAM J Comput 12(3):508\u2013525","journal-title":"SIAM J Comput"},{"key":"9125_CR2","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9:846\u2013855","journal-title":"SIAM J Comput"},{"key":"9125_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"9125_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF00264439","volume":"18","author":"DJ Brown","year":"1982","unstructured":"Brown DJ, Baker BS, Katseff HP (1982) Lower bounds for on-line two-dimensional packing algorithms. Acta Inform 18:207\u2013225","journal-title":"Acta Inform"},{"key":"9125_CR5","unstructured":"Chan WT, Chin FYL, Ye D, Zhang G, Zhang Y (2007) On-line scheduling of parallel jobs on two machines. In: Proceedings of the 16th Australasian workshop on combinatorial algorithms (AWOCA), Victoria, Australia, September 2005. J Discrete Algorithms (to appear)"},{"key":"9125_CR6","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman","year":"1980","unstructured":"Coffman EG, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level oriented two dimensional packing algorithms. SIAM J Comput 9:808\u2013826","journal-title":"SIAM J Comput"},{"key":"9125_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0020-0190(97)00120-8","volume":"63","author":"J Csirik","year":"1997","unstructured":"Csirik J, Woeginger GJ (1997) Shelf algorithm for on-line strip packing. Inf Process Lett 63:171\u2013175","journal-title":"Inf Process Lett"},{"key":"9125_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online algorithms: the state of the art","author":"J Csirik","year":"1998","unstructured":"Csirik J, Woeginger GJ (1998) Online packing and covering problems. In: Online algorithms: the state of the art. Lecture Notes in Computer Science, vol\u00a01442. Springer, Berlin, pp\u00a0147\u2013178"},{"key":"9125_CR9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J Du","year":"1989","unstructured":"Du J, Leung J (1989) Complexity of scheduling parallel task systems. SIAM J Discrete Math 2:473\u2013487","journal-title":"SIAM J Discrete Math"},{"key":"9125_CR10","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"M Drozdowski","year":"2004","unstructured":"Drozdowski M (2004) Scheduling parallel tasks\u2014algorithms and complexity. In: Leung JY-T (ed) Handbook of scheduling: algorithms, models and performance analysis. CRC Press, Boca Raton, Chap.\u00a025"},{"key":"9125_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-540-72870-2_34","volume-title":"Proceedings of the 3rd international conference on algorithmic aspects in information and management (AAIM)","author":"X Han","year":"2007","unstructured":"Han X, Iwama K, Ye D, Zhang G (2007) Strip packing vs. bin packing. In: Proceedings of the 3rd international conference on algorithmic aspects in information and management (AAIM), Portland, 6\u20138\u00a0June. Lecture notes in computer science, vol\u00a04508. Springer, Berlin pp\u00a0358\u2013367"},{"key":"9125_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.orl.2007.06.001","volume":"36","author":"JL Hurink","year":"2007","unstructured":"Hurink JL, Paulus JJ (2007a) Online scheduling of parallel jobs on two machines is 2-competitive. Oper Res Lett 36:51\u201356","journal-title":"Oper Res Lett"},{"key":"9125_CR13","series-title":"Lecture notes in computer science","first-page":"67","volume-title":"Proceedings of the 5th workshop on approximation and online algorithms (WAOA)","author":"JL Hurink","year":"2007","unstructured":"Hurink JL, Paulus JJ (2007b) Online algorithm for paralled job scheduling and strip packing. In: Proceedings of the 5th workshop on approximation and online algorithms (WAOA), Eilat, Israel, 11\u201312 October. Lecture notes in computer science, vol\u00a04927. Springer, Berlin, pp\u00a067\u201374"},{"key":"9125_CR14","doi-asserted-by":"crossref","unstructured":"Jansen K, Stee RV (2005) On strip packing with rotations. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC), pp\u00a0755\u2013761","DOI":"10.1145\/1060590.1060702"},{"key":"9125_CR15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10951-006-8497-6","volume":"9","author":"B Johannes","year":"2006","unstructured":"Johannes B (2006) Scheduling parallel jobs to minimize makespan. J Sched 9:433\u2013452","journal-title":"J Sched"},{"key":"9125_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:299\u2013325","journal-title":"SIAM J Comput"},{"key":"9125_CR17","doi-asserted-by":"crossref","unstructured":"Kenyon C, R\u00e9mila E (1996) Approximate strip packing. In: Proceedings of the 37th annual symposium on foundations of computer science (FOCS), pp\u00a031\u201336","DOI":"10.1109\/SFCS.1996.548461"},{"key":"9125_CR18","doi-asserted-by":"crossref","unstructured":"Schiermeyer I (1994) Reverse-fit: a 2-optimal algorithm for packing rectangles. In: Proceedings of the second annual European symposium on algorithms (ESA), pp\u00a0290\u2013299","DOI":"10.1007\/BFb0049416"},{"issue":"2","key":"9125_CR19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A Steinberg","year":"1997","unstructured":"Steinberg A (1997) A strip-packing algorithm with absolute performance bound 2. SIAM J Comput 26(2):401\u2013409","journal-title":"SIAM J Comput"},{"key":"9125_CR20","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10951-007-0032-x","volume":"10","author":"D Ye","year":"2007","unstructured":"Ye D, Zhang G (2007) On-line scheduling of parallel jobs in a list. J Sched 10:407\u2013413","journal-title":"J Sched"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9125-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9125-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9125-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9125-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,5]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9125"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9125-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,5]]}}}