{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:52:26Z","timestamp":1761292346414},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10951-006-8499-4","type":"journal-article","created":{"date-parts":[[2006,6,16]],"date-time":"2006-06-16T07:47:07Z","timestamp":1150444027000},"page":"493-495","source":"Crossref","is-referenced-by-count":13,"title":["On a parallel machine scheduling problem with precedence constraints"],"prefix":"10.1007","volume":"9","author":[{"given":"Isto","family":"Aho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erkki","family":"M\u00e4kinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8499_CR1","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Cormen T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"8499_CR2","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"R. L. Graham","year":"1989","unstructured":"Graham R. L., D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, Reading, MA, 1989."},{"key":"8499_CR3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo M., Scheduling: Theory, Algorithms, and Systems, Prentice Hall Englewood Cliffs, NJ, 1995."},{"key":"8499_CR4","first-page":"23","volume":"26","author":"J. K. Lenstra","year":"1987","unstructured":"Lenstra J. K. and Rinnooy Kan A. H. G., \u201cComplexity of scheduling under precedence constraints,\u201d Operations Research, 26, 23\u201335 (1987).","journal-title":"Operations Research"},{"key":"8499_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton R., \u201cScheduling with deadlines and loss functions,\u201d Management Science, 6, 1\u201312 (1959).","journal-title":"Management Science"},{"key":"8499_CR6","unstructured":"Woeginger G. J., \u201cOpen problems in the theory of scheduling,\u201d Bulletin of the European Association for Theoretical Computer Science, 76, 67\u201383 (2002)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8499-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8499-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8499-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:39Z","timestamp":1559468379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8499-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["8499"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8499-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}