{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:03Z","timestamp":1725549903679},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_52","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"580-591","source":"Crossref","is-referenced-by-count":3,"title":["Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays"],"prefix":"10.1007","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey V.","family":"Sevastyanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic scheduling: A survey. Annals of Discrete Mathematics, 287\u2013326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory. Handbooks in Operation Research and Management Science","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory. Handbooks in Operation Research and Management Science, vol.\u00a04, pp. 445\u2013522. North-Holland, Amsterdam (1993)"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6 (1959)","DOI":"10.1287\/mnsc.6.1.1"},{"key":"52_CR4","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Recucibility among combinatorial problems. In: Complexity of Computer Computations. Plenum Press, New York (1972)"},{"key":"52_CR5","first-page":"347","volume":"12","author":"M.H. Rothkopf","year":"1966","unstructured":"Rothkopf, M.H.: Scheduling independent tasks on parallel processors. Management Science\u00a012, 347\u2013447 (1966)","journal-title":"Management Science"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing\u00a017, 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(00)00179-7","volume":"108","author":"C. Hanen","year":"2001","unstructured":"Hanen, C., Munier, A.: An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Discrete Applied Mathematics\u00a0108, 239\u2013257 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","volume":"16","author":"J.A. Hoogeveen","year":"1994","unstructured":"Hoogeveen, J.A., Lenstra, J.K., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters\u00a016, 129\u2013137 (1994)","journal-title":"Operations Research Letters"},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling\u00a02, 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"52_CR10","unstructured":"Engels, D.W., Feldman, J., Karger, D.R., Ruhl, M.: Parallel processor scheduling with delay constraints. In: SODA, pp. 577\u2013585 (2001)"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-44520-X_38","volume-title":"Euro-Par 2000 Parallel Processing","author":"F.N. Afrati","year":"2000","unstructured":"Afrati, F.N., Bampis, E., Finta, L., Milis, I.: Scheduling trees with large communication delays on two identical processors. In: Bode, A., Ludwig, T., Karl, W.C., Wism\u00fcller, R. (eds.) Euro-Par 2000. LNCS, vol.\u00a01900, pp. 288\u2013295. Springer, Heidelberg (2000)"},{"key":"52_CR12","unstructured":"Engels, D.W.: Scheduling for hardware-software partitioning in embedded system design. PhD thesis, Massachusetts Institute of Technology, Cambridge, USA (2000)"},{"key":"52_CR13","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comp. System Sci. (1973)","DOI":"10.1016\/S0022-0000(73)80033-9"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:45Z","timestamp":1605642645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11561071_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}