{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:05:56Z","timestamp":1777953956010,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175138","type":"print"},{"value":"9783642175145","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_24","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"279-290","source":"Crossref","is-referenced-by-count":9,"title":["Increasing Speed Scheduling and Flow Scheduling"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Stiller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"32","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999)","author":"F. Afrati","year":"1999","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 32\u201344. IEEE, Los Alamitos (1999)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1287\/moor.1090.0382","volume":"34","author":"N. Baumann","year":"2009","unstructured":"Baumann, N., Skutella, M.: Earliest arrival flows with multiple sources. Mathematics of Operations Research\u00a034, 499\u2013512 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-13036-6_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"L. Epstein","year":"2010","unstructured":"Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on a single machine. In: Eisenbrand, F., Shepherd, F.B. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol.\u00a06080, pp. 230\u2013243. Springer, Heidelberg (2010)"},{"key":"24_CR4","unstructured":"Fleischer, L.: Faster algorithms for the quickest transshipment problem with zero transit times. In: Proceedings of the 9th Annual Symposium on Discrete Algorithms (SODA 1998), pp. 147\u2013156 (1998)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"Gale, D.: Transient flows in networks. Michigan Mathematical Journal\u00a06, 59\u201363 (1959)","journal-title":"Michigan Mathematical Journal"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-45061-0_33","volume-title":"Automata, Languages and Programming","author":"A. Hall","year":"2003","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 397\u2013409. Springer, Heidelberg (2003)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","volume":"379","author":"A. Hall","year":"2007","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science\u00a0379, 387\u2013404 (2007)","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45253-2_25","volume-title":"Algorithms - ESA 2000","author":"H. Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 268\u2013277. Springer, Heidelberg (2000)"},{"key":"24_CR9","unstructured":"Hoppe, B., Tardos, \u00c9.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th Annual Symposium on Discrete Algorithms (SODA 1994), pp. 433\u2013441 (1994)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in Combinatorial Optimization","author":"J. Labetoulle","year":"1984","unstructured":"Labetoulle, J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of uniform machines subject to release dates. In: Progress in Combinatorial Optimization, pp. 245\u2013261. Academic Press, London (1984)"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1287\/opre.32.2.440","volume":"32","author":"I. Meilijson","year":"1984","unstructured":"Meilijson, I., Tamir, A.: Minimizing flow time on parallel identical processors with variable unit processing time. Operations Research\u00a032(2), 440\u2013448 (1984)","journal-title":"Operations Research"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"Minieka, E.: Maximal, lexicographic, and dynamic network flows. Operations Research\u00a021, 517\u2013527 (1973)","journal-title":"Operations Research"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-59408-6_60","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Queyranne","year":"1995","unstructured":"Queyranne, M., Schulz, A.S.: Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speed. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol.\u00a0920, pp. 307\u2013320. Springer, Heidelberg (1995)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Schulz, A.S., Skutella, M.: The power of \u03b1-points in preemptive single machine scheduling. Journal of Scheduling, 121\u2013133 (2002)","DOI":"10.1002\/jos.93"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Research and Logistics Quarterly, 59\u201366 (1956)","DOI":"10.1002\/nav.3800030106"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Stiller, S., Wiese, A.: Increasing speed scheduling and flow scheduling. Technical Report 007-2010, Technische Universit\u00e4t Berlin (February 2010)","DOI":"10.1007\/978-3-642-17514-5_24"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W.L. Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Operations Research\u00a019, 1602\u20131612 (1971)","journal-title":"Operations Research"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Zadeh, N.: A bad network problem for the simplex method and other minimum cost flow algorithms (1973)","DOI":"10.1007\/BF01580132"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:10Z","timestamp":1559836150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}