{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T18:44:54Z","timestamp":1773859494214,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1023\/a:1024012811536","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T21:07:28Z","timestamp":1063400848000},"page":"395-404","source":"Crossref","is-referenced-by-count":12,"title":["A Note on Scheduling Tall\/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness"],"prefix":"10.1007","volume":"6","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5124579_CR1","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, 1996.","DOI":"10.1007\/978-3-662-03217-6"},{"key":"5124579_CR2","doi-asserted-by":"crossref","unstructured":"Brucker, P., Scheduling Algorithms, 3rd edn, Springer, 2001.","DOI":"10.1007\/978-3-662-04550-3"},{"key":"5124579_CR3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0377-2217(95)00350-9","volume":"90","author":"P. Brucker","year":"1996","unstructured":"Brucker, P. and A. Kr\u00e4mer, \u201cPolynomial algorithms for resource-constrained and multiprocessor task scheduling problems,\u201d Eur. J. Oper. Res., 90, 214-226 (1996).","journal-title":"Eur. J. Oper. Res."},{"key":"5124579_CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.29.1.189","volume":"29","author":"E. L. Lloyd","year":"1981","unstructured":"Lloyd, E. L., \u201cConcurrent task systems,\u201d Oper. Res., 29, 189-201 (1981).","journal-title":"Oper. Res."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024012811536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024012811536\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024012811536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:50:00Z","timestamp":1751633400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024012811536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["5124579"],"URL":"https:\/\/doi.org\/10.1023\/a:1024012811536","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}