{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:55Z","timestamp":1759847335353},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,20]],"date-time":"2011-11-20T00:00:00Z","timestamp":1321747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00236-011-0146-7","type":"journal-article","created":{"date-parts":[[2011,11,19]],"date-time":"2011-11-19T07:35:51Z","timestamp":1321688151000},"page":"1-14","source":"Crossref","is-referenced-by-count":8,"title":["An efficient algorithm for finding ideal schedules"],"prefix":"10.1007","volume":"49","author":[{"suffix":"Jr.","given":"Edward G.","family":"Coffman","sequence":"first","affiliation":[]},{"given":"Dariusz","family":"Dereniowski","sequence":"additional","affiliation":[]},{"given":"Wies\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"issue":"1","key":"146_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s001860300336","volume":"60","author":"P. Baptiste","year":"2004","unstructured":"Baptiste P., Timkovsky V.G.: Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Math. Methods Oper. Res. 60(1), 145\u2013153 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"146_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E.G. Coffman Jr","year":"1972","unstructured":"Coffman E.G. Jr, Graham R.L.: Optimal scheduling for two-processor systems. Acta Inf. 1, 200\u2013213 (1972)","journal-title":"Acta Inf."},{"issue":"8","key":"146_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00236-003-0119-6","volume":"39","author":"E.G. Coffman Jr","year":"2003","unstructured":"Coffman E.G. Jr, Sethuraman J., Timkovsky V.G.: Ideal preemptive schedules on two processors. Acta Inf. 39(8), 597\u2013612 (2003)","journal-title":"Acta Inf."},{"key":"146_CR4","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: SWAT \u201971: Proceedings of the 12th Annual Symposium on Switching and Automata Theory (1971), pp. 129\u2013131. IEEE Computer Society, Washington, DC, USA (1971)","DOI":"10.1109\/SWAT.1971.4"},{"issue":"6","key":"146_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"146_CR6","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","volume":"17","author":"M. Fujii","year":"1969","unstructured":"Fujii, M., Kasami, T., Ninomiya, K.: Optimal sequencing of two equivalent processors. SIAM J Appl. Math. 17, 784\u2013789 (1969); Erratum 20:141 (1971)","journal-title":"SIAM J Appl. Math."},{"key":"146_CR7","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1145\/322326.322335","volume":"29","author":"H.N. Gabow","year":"1982","unstructured":"Gabow H.N.: An almost-linear algorithm for two-processor scheduling. J. ACM 29, 766\u2013780 (1982)","journal-title":"J. ACM"},{"issue":"3","key":"146_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/321958.321967","volume":"23","author":"M.R. Garey","year":"1976","unstructured":"Garey M.R., Johnson D.S.: Scheduling tasks with nonuniform deadlines on two processors. J. ACM 23(3), 461\u2013467 (1976)","journal-title":"J. ACM"},{"issue":"3","key":"146_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"M.R. Garey","year":"1977","unstructured":"Garey M.R., Johnson D.S.: Two-processor scheduling with start-times and deadlines. SIAM J. Comput. 6(3), 416\u2013426 (1977)","journal-title":"SIAM J. Comput."},{"key":"146_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.K.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"146_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall S.: A theorem on Boolean matrices. J. ACM 9(1), 11\u201312 (1962)","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0146-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-011-0146-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0146-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0146-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T02:10:48Z","timestamp":1581991848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-011-0146-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,20]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["146"],"URL":"https:\/\/doi.org\/10.1007\/s00236-011-0146-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,20]]}}}