{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:21Z","timestamp":1725559761321},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_51","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"627-638","source":"Crossref","is-referenced-by-count":31,"title":["Reordering Buffer Management for Non-uniform Cost Models"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Englert","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Westermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/361268.361278","volume":"15","author":"T. Teorey","year":"1972","unstructured":"Teorey, T., Pinkerton, T.: A comparative analysis of disk scheduling policies. Communications of the ACM\u00a015, 177\u2013184 (1972)","journal-title":"Communications of the ACM"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp., R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms\u00a012, 685\u2013699 (1991)","journal-title":"Journal of Algorithms"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S.: New results on web caching with request reordering. In: Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 84\u201392 (2004)","DOI":"10.1145\/1007912.1007925"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.tcs.2004.05.016","volume":"324","author":"T. Feder","year":"2004","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Seiden, S., van Stee, R., Zhu, A.: Combining request scheduling with web caching. Theoretical Compuer Science\u00a0324, 201\u2013218 (2004)","journal-title":"Theoretical Compuer Science"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/3-540-45749-6_71","volume-title":"Algorithms - ESA 2002","author":"H. R\u00e4cke","year":"2002","unstructured":"R\u00e4cke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 820\u2013832. Springer, Heidelberg (2002)"},{"key":"51_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-24698-5_23","volume-title":"LATIN 2004: Theoretical Informatics","author":"J. Kohrt","year":"2004","unstructured":"Kohrt, J., Pruhs, K.: A constant approximation algorithm for sorting buffers. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 193\u2013202. Springer, Heidelberg (2004)"},{"key":"51_CR7","unstructured":"Krokowski, J., R\u00e4cke, H., Sohler, C., Westermann, M.: Reducing state changes with a pipeline buffer. In: Proceedings of the 9th International Fall Workshop Vision, Modeling, and Visualization (VMV), pp. 217\u2013224 (2004)"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1080\/00207540310001646821","volume":"42","author":"K. Gutenschwager","year":"2004","unstructured":"Gutenschwager, K., Spieckermann, S., Voss, S.: A sequential ordering problem in automotive paint shops. International Journal of Production Research\u00a042, 1865\u20131878 (2004)","journal-title":"International Journal of Production Research"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s002240000100","volume":"31","author":"T. Yeh","year":"1998","unstructured":"Yeh, T., Kuo, C., Lei, C., Yen, H.: Competitive analysis of on-line disk scheduling. Theory of Computing Systems\u00a031, 491\u2013506 (1998)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:03Z","timestamp":1619506023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11523468_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}