{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:36Z","timestamp":1744217436679,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_71","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"820-832","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Online Scheduling for Sorting Buffers"],"prefix":"10.1007","author":[{"given":"Harald","family":"R\u00e4cke","sequence":"first","affiliation":[]},{"given":"Christian","family":"Sohler","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Westermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"71_CR1","unstructured":"T. Feder, R. Motwani, R. Panigrahy, and A. Zhu.Web caching with request reordering.In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA),pages 104\u2013105,2002."},{"issue":"2","key":"71_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, R.M. Karp., M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive paging algorithms.Journal of Algorithms 12(2):685\u2013699,1991.","journal-title":"Journal of Algorithms"},{"key":"71_CR3","first-page":"303","volume":"2","author":"C.B. Fraser","year":"1995","unstructured":"C.B. Fraser and R.W. Irving. Approximation algorithms for the shortest common supersequence.Nordic Journal of Computing 2:303\u2013325,1995.","journal-title":"Nordic Journal of Computing"},{"key":"71_CR4","unstructured":"M.J. Garey and D.S. Johnson.Computers and intractability: A guide to the theory of NP-completeness Freeman,1979."},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"T. Jiang and M. Li.On the approximation of shortest common supersequences and longest common subsequence. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP),pages 191\u2013202,1994.","DOI":"10.1007\/3-540-58201-0_68"},{"key":"71_CR6","doi-asserted-by":"crossref","unstructured":"D. Karger, C. Stein, and J. Wein.Scheduling algorithms.In M.J. Atallah,editor, Handbook of Algorithms and Theory of Computation CRC Press,1997.","DOI":"10.1201\/9781420049503-c36"},{"key":"71_CR7","doi-asserted-by":"crossref","unstructured":"S.O. Krumke, W.E. DePaepe, J. Rambau, and L. Stougie.Online bin-coloring. In Proceedings of the 9th European Symposium on Algorithms (ESA),pages 74\u201385, 2001.","DOI":"10.1007\/3-540-44676-1_6"},{"key":"71_CR8","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoy. Sequencing and scheduling:Algorithms and complexity.In S.C. Grave, A.H.G. Rinnooy Kan, and P. Zipkin,editors, Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory pages 445\u2013552.North-Holland, 1993.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"71_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algo-rithms: The State of the Art volume","author":"J. Sgall","year":"1998","unstructured":"J. Sgall. On-line scheduling.In A. Fiat and G. Woeginger,editors,Online Algo-rithms: The State of the Art volume1442,pages 196\u2013231.Springer LNCS,1998."},{"issue":"2","key":"71_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan.Amortized effciency of list update and paging rules.Communications of the ACM 28(2):202\u2013208,1985.","journal-title":"Communications of the ACM"},{"key":"71_CR11","unstructured":"S. Spieckermann and S. Vo.Paintshop simulation in the automotive industry.In Proceedings of the Workshop for Simulation and Animation in Planning, Education, and Presentation pages 367\u2013380,1996."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:00:52Z","timestamp":1676685652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45749-6_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_71","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}