{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:49:23Z","timestamp":1649044163957},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T00:00:00Z","timestamp":1440720000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC)","award":["OPG0105675"],"award-info":[{"award-number":["OPG0105675"]}]},{"name":"Polish National Science Center","award":["DEC-2011\/02\/A\/ST6\/00201"],"award-info":[{"award-number":["DEC-2011\/02\/A\/ST6\/00201"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10951-015-0446-9","type":"journal-article","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T04:19:44Z","timestamp":1440649184000},"page":"701-728","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Normal-form preemption sequences for an open problem in scheduling theory"],"prefix":"10.1007","volume":"19","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Coffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz","family":"Dereniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"2","key":"446_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10288-003-0024-4","volume":"2","author":"P Baptiste","year":"2004","unstructured":"Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. (2004). Ten notes on equal-processing-time scheduling. 4OR, 2(2), 111\u2013127.","journal-title":"4OR"},{"issue":"5","key":"446_CR2","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.dam.2010.11.015","volume":"159","author":"P Baptiste","year":"2011","unstructured":"Baptiste, P., Carlier, J., Kononov, A., Queyranne, M., Sevastyanov, S., & Sviridenko, M. (2011). Properties of optimal schedules in preemptive shop scheduling. Discrete Applied Mathematics, 159(5), 272\u2013280.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"446_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0167-6377(01)00068-2","volume":"28","author":"P Baptiste","year":"2001","unstructured":"Baptiste, P., & Timkovsky, V. (2001). On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters, 28(5), 205\u2013212.","journal-title":"Operations Research Letters"},{"issue":"1","key":"446_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s001860300336","volume":"60","author":"P Baptiste","year":"2004","unstructured":"Baptiste, P., & Timkovsky, V. (2004). Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Mathematical Methods of Operations Research, 60(1), 145\u2013153.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"446_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s001860200228","volume":"56","author":"P Brucker","year":"2003","unstructured":"Brucker, P., Hurink, J., & Knust, S. (2003). A polynomial algorithm for P $$\\vert \\, \\text{ p }_{\\rm j}=1, \\text{ r }_{{\\rm j}}$$ | p j = 1 , r j , outtree $$\\vert \\, \\sum {\\text{ c }}_{{\\rm j}}$$ | \u2211 c j . Mathematical Methods of Operations Research, 56(3), 407\u2013412.","journal-title":"Mathematical Methods of Operations Research"},{"key":"446_CR6","unstructured":"Carlier, A., Hanen, C., & Munier-Kordon, A. (2014) Equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays. New Challenges in Scheduling Theory, March 31\u2013April 4, Aussois, France."},{"key":"446_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00236-011-0146-7","volume":"6","author":"E Coffman Jr","year":"2012","unstructured":"Coffman, E, Jr, Dereniowski, D., & Kubiak, W. (2012). An efficient algorithm for an ideal scheduling problem. Acta Informatica, 6, 1\u201314.","journal-title":"Acta Informatica"},{"key":"446_CR8","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E Coffman Jr","year":"1972","unstructured":"Coffman, E, Jr, & Graham, R. (1972). Optimal scheduling for two-processor systems. Acta Informatica, 1, 200\u2013213.","journal-title":"Acta Informatica"},{"issue":"2","key":"446_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10951-013-0355-8","volume":"18","author":"E Coffman Jr","year":"2015","unstructured":"Coffman, E, Jr, Ng, C., & Timkovsky, V. (2015). How small are shifts required in optimal preemptive schedules? Journal of Scheduling, 18(2), 155\u2013163.","journal-title":"Journal of Scheduling"},{"issue":"8","key":"446_CR10","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00236-003-0119-6","volume":"39","author":"E Coffman Jr","year":"2003","unstructured":"Coffman, E, Jr, Sethuraman, J., & Timkovsky, V. (2003). Ideal preemptive schedules on two processors. Acta Informatica, 39(8), 597\u2013612.","journal-title":"Acta Informatica"},{"key":"446_CR11","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","volume":"17","author":"M Fujii","year":"1971","unstructured":"Fujii, M., Kasami, T., & Ninomiya, K. (1971). Optimal sequencing of two equivalent processors. SIAM Journal on Applied Mathematics, 17, 784\u2013789. Erratum 20 (1971) 141.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"446_CR12","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/322326.322335","volume":"29","author":"H Gabow","year":"1982","unstructured":"Gabow, H. (1982). An almost-linear algorithm for two-processor scheduling. Journal of ACM, 29, 766\u2013780.","journal-title":"Journal of ACM"},{"issue":"3","key":"446_CR13","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","volume":"23","author":"M Garey","year":"1976","unstructured":"Garey, M., & Johnson, D. (1976). Scheduling tasks with nonuniform deadlines on two processors. Journal of ACM, 23(3), 461\u2013467.","journal-title":"Journal of ACM"},{"issue":"3","key":"446_CR14","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"M Garey","year":"1977","unstructured":"Garey, M., & Johnson, D. (1977). Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing, 6(3), 416\u2013426.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"446_CR15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.38.3.487","volume":"38","author":"LA Herrbach","year":"1990","unstructured":"Herrbach, L. A., & Leung, J. Y. T. (1990). Preemptive scheduling of equal length jobs on two machines to minimize mean flow time. Operations Research, 38(3), 487\u2013494.","journal-title":"Operations Research"},{"issue":"2","key":"446_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00186-005-0009-5","volume":"62","author":"Y Huo","year":"2005","unstructured":"Huo, Y., & Leung, J. Y. (2005). Minimizing total completion time for UET tasks with release time and outtree precedence constraints. Mathematical Methods of Operations Research, 62(2), 275\u2013279.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1","key":"446_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/383721.383733","volume":"23","author":"A Leung","year":"2001","unstructured":"Leung, A., Palem, K., & Pnueli, A. (2001). Scheduling time-constrained instructions on pipelined processors. ACM Transactions on Programming Languages and Systems, 23(1), 73\u2013103.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"446_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00337697","volume":"4","author":"NW Sauer","year":"1987","unstructured":"Sauer, N. W., & Stone, M. G. (1987). Rational preemptive scheduling. Order, 4, 195\u2013206.","journal-title":"Order"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0446-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0446-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0446-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0446-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:14:00Z","timestamp":1553642040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0446-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,28]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["446"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0446-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,28]]}}}