{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:30:08Z","timestamp":1759847408426},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0166-218x(93)90042-m","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T11:06:34Z","timestamp":1034334394000},"page":"123-138","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms for minimizing maximum lateness with unit length tasks and resource constraints"],"prefix":"10.1016","volume":"42","author":[{"given":"J.","family":"B\u0142azewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Martello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90042-M_BIB1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(77)90015-1","article-title":"Simple algorithms for multiprocessor scheduling to meet deadlines","volume":"6","author":"B\u0142azewicz","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)90042-M_BIB2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0377-2217(86)90138-4","article-title":"Scheduling tasks on two processors with deadlines and additional resources","volume":"26","author":"B\u0142azewicz","year":"1986","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(93)90042-M_BIB3","article-title":"Scheduling under resource constraints: deterministic models","volume":"7","author":"B\u0142azewicz","year":"1986"},{"key":"10.1016\/0166-218X(93)90042-M_BIB4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0167-6377(83)90042-1","article-title":"A linear time algorithm for restricted bin packing and scheduling problems","volume":"2","author":"B\u0142azewicz","year":"1983","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(93)90042-M_BIB5","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF00263292","article-title":"Minimizing mean flow time under resource constraints","volume":"24","author":"B\u0142azewicz","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(93)90042-M_BIB6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: classification and complexity","volume":"5","author":"B\u0142azewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90042-M_BIB7","year":"1976"},{"key":"10.1016\/0166-218X(93)90042-M_BIB8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0605003","article-title":"Preemptive scheduling, linear programming and network flows","volume":"5","author":"de Werra","year":"1984","journal-title":"SIAM J. Algebraic Discrete Math."},{"key":"10.1016\/0166-218X(93)90042-M_BIB9","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity results for multiprocessor scheduling under resource constraints","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90042-M_BIB10","first-page":"287","article-title":"Optimization and approximation in deterministic sequencing and scheduling theory: a survey","volume":"5","author":"Graham","year":"1979"},{"key":"10.1016\/0166-218X(93)90042-M_BIB11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(79)90061-9","article-title":"Bounds on list scheduling of UET tasks with restricted resource constraints","volume":"9","author":"Leung","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)90042-M_BIB12","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0020-0190(81)90075-2","article-title":"Coffman-Graham scheduling of UET task systems with 0\u20131 resources","volume":"12","author":"Lloyd","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)90042-M_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.29.1.189","article-title":"Concurrent task systems","volume":"29","author":"Lloyd","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90042-M_BIB14","series-title":"Advances in Project Scheduling","first-page":"29","article-title":"The order theoretic approach to scheduling: Deterministic case","author":"M\u00f6hring","year":"1989"},{"key":"10.1016\/0166-218X(93)90042-M_BIB15","first-page":"1","article-title":"Some new results in flow shop scheduling","volume":"28","author":"R\u00f6ck","year":"1984","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0166-218X(93)90042-M_BIB16","first-page":"536","article-title":"Scheduling preemptible tasks on unrelated processors with additional resources to minimize schedule length","volume":"65","author":"S\u0142owinski","year":"1978"},{"key":"10.1016\/0166-218X(93)90042-M_BIB17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/355744.355755","article-title":"An automatic revised simplex method for constrained resource network scheduling","volume":"3","author":"Weglarz","year":"1977","journal-title":"ACM Trans. Math. Software"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390042M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390042M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:29:18Z","timestamp":1555180158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390042M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0166218X9390042M"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90042-m","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}