{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:50:16Z","timestamp":1742950216175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_63","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"756-767","source":"Crossref","is-referenced-by-count":2,"title":["Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times \u2013 A Polymatroid Optimization Approach"],"prefix":"10.1007","author":[{"given":"Natalia V.","family":"Shakhlevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akiyoshi","family":"Shioura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly A.","family":"Strusevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"23","author":"R.K. Ahuja","year":"1994","unstructured":"Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flow. SIAM J. Comput.\u00a023, 906\u2013933 (1994)","journal-title":"SIAM J. Comput."},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/0165-6074(89)90146-4","volume":"27","author":"J.Y. Chung","year":"1989","unstructured":"Chung, J.Y., Shih, W.-K., Liu, J.W.S., Gillies, D.W.: Scheduling imprecise computations to minimize total error. Microprocessing and Microprogramming\u00a027, 767\u2013774 (1989)","journal-title":"Microprocessing and Microprogramming"},{"key":"63_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/mnsc.32.3.341","volume":"32","author":"A. Federgruen","year":"1986","unstructured":"Federgruen, A., Groenevelt, H.: Preemptive scheduling of uniform machines by ordinary network flow techniques. Management Sci.\u00a032, 341\u2013349 (1986)","journal-title":"Management Sci."},{"key":"63_CR4","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput.\u00a018, 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T.F. Gonzales","year":"1978","unstructured":"Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM\u00a025, 92\u2013101 (1978)","journal-title":"J. ACM"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0166-218X(90)90093-R","volume":"28","author":"D.S. Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shamir, R.: Minimizing the number of tardy job unit under release time constraints. Discrete Appl. Math.\u00a028, 45\u201357 (1990)","journal-title":"Discrete Appl. Math."},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W. Horn","year":"1974","unstructured":"Horn, W.: Some simple scheduling algorithms. Naval Res. Logist.\u00a0Quat.\u00a021, 177\u2013185 (1974)","journal-title":"Naval Res. Logist.\u00a0Quat."},{"key":"63_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A. Janiak","year":"1996","unstructured":"Janiak, A., Kovalyov, M.Y.: Single machine scheduling with deadlines and resource dependent processing times. European J. Oper. Res.\u00a094, 284\u2013291 (1996)","journal-title":"European J. Oper. Res."},{"key":"63_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling, ch. 34","author":"J.Y.-T. Leung","year":"2004","unstructured":"Leung, J.Y.-T.: Minimizing total weighted error for imprecise computation tasks and related problems. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling, ch. 34. Chapman & Hall, Boca Raton (2004)"},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0166-218X(92)00037-M","volume":"51","author":"J.Y.-T. Leung","year":"1994","unstructured":"Leung, J.Y.-T., Yu, V.K.M., Wei, W.-D.: Minimizing the weighted number of tardy task units. Discrete Appl. Math.\u00a051, 307\u2013316 (1994)","journal-title":"Discrete Appl. Math."},{"key":"63_CR12","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1287\/opre.47.5.744","volume":"47","author":"S.T. McCormick","year":"1999","unstructured":"McCormick, S.T.: Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. Oper. Res.\u00a047, 744\u2013756 (1999)","journal-title":"Oper. Res."},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"12","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Sci.\u00a012, 1\u201312 (1959)","journal-title":"Management Sci."},{"key":"63_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(94)00071-5","volume":"63","author":"E. Nowicki","year":"1995","unstructured":"Nowicki, E., Zdrza\u0142ka, S.: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times. Discrete Appl.\u00a0Math.\u00a063, 237\u2013256 (1995)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"63_CR15","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.27.5.925","volume":"27","author":"S. Sahni","year":"1979","unstructured":"Sahni, S.: Preemptive scheduling with due dates. Oper. Res.\u00a027, 925\u2013934 (1979)","journal-title":"Oper. Res."},{"key":"63_CR16","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/322203.322214","volume":"27","author":"S. Sahni","year":"1980","unstructured":"Sahni, S., Cho, Y.: Scheduling independent tasks with due times on a uniform processor system. J. ACM\u00a027, 550\u2013563 (1980)","journal-title":"J. ACM"},{"key":"63_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10951-005-6813-1","volume":"8","author":"N.V. Shakhlevich","year":"2005","unstructured":"Shakhlevich, N.V., Strusevich, V.A.: Preemptive scheduling problems with controllable processing times. J. Sched.\u00a08, 233\u2013253 (2005)","journal-title":"J. Sched."},{"key":"63_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00453-007-9091-9","volume":"51","author":"N.V. Shakhlevich","year":"2008","unstructured":"Shakhlevich, N.V., Strusevich, V.A.: Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica\u00a051, 451\u2013473 (2008)","journal-title":"Algorithmica"},{"key":"63_CR19","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/REAL.2000.896019","volume-title":"21th IEEE Real-Time Syst. Symp.","author":"W.-K. Shih","year":"2000","unstructured":"Shih, W.-K., Lee, C.-R., Tang, C.-H.: A fast algorithm for scheduling imprecise computations with timing constraints to minimize weighted error. In: 21th IEEE Real-Time Syst. Symp., pp. 305\u2013310. IEEE Computer Society, Los Alamitos (2000)"},{"key":"63_CR20","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0220035","volume":"20","author":"W.-K. Shih","year":"1991","unstructured":"Shih, W.-K., Liu, J.W.S., Chung, J.-Y.: Algorithms for scheduling imprecise computations with timing constraints. SIAM J. Comput.\u00a020, 537\u2013552 (1991)","journal-title":"SIAM J. Comput."},{"key":"63_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/71021.71022","volume":"23","author":"W.-K. Shih","year":"1989","unstructured":"Shih, W.-K., Liu, J.W.S., Chung, J.-Y., Gillies, D.W.: Scheduling tasks with ready times and deadlines to minimize average error. ACM SIGOPS Oper. Syst., Rev.\u00a023, 14\u201328 (1989)","journal-title":"ACM SIGOPS Oper. Syst., Rev."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:20:09Z","timestamp":1715059209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}