{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T16:57:34Z","timestamp":1763398654726},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":3546,"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":[[2003,11]]},"DOI":"10.1016\/s0166-218x(03)00433-5","type":"journal-article","created":{"date-parts":[[2003,10,31]],"date-time":"2003-10-31T23:43:26Z","timestamp":1067643806000},"page":"45-68","source":"Crossref","is-referenced-by-count":47,"title":["Scheduling problems for parallel dedicated machines under multiple resource constraints"],"prefix":"10.1016","volume":"133","author":[{"given":"H.","family":"Kellerer","sequence":"first","affiliation":[]},{"given":"V.A.","family":"Strusevich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00433-5_BIB1","first-page":"8","article-title":"A polynomial-time algorithm of approximate solution of a scheduling problem","volume":"28","author":"Aksjonov","year":"1988","journal-title":"Upravlyaemye Sistemy"},{"key":"10.1016\/S0166-218X(03)00433-5_BIB2","unstructured":"J. B\u0142a\u017eewicz, W. Cellary, R. Slowi\u0144ski, J. W\u0229glarz, Scheduling under resource constraints, Ann. Oper. Res. 7 (1987)."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints","volume":"5","author":"B\u0142a\u017eewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/ijoc.5.3.321","article-title":"Approximation algorithms for three machine open shop scheduling","volume":"5","author":"Chen","year":"1993","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB5","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(03)00433-5_BIB6","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1","article-title":"Scheduling for parallel dedicated machines with a single server","volume":"47","author":"Glass","year":"2000","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB8","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/opre.45.4.544","article-title":"Two-machine open shops with renewable resources","volume":"45","author":"Jurisch","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB9","doi-asserted-by":"crossref","unstructured":"H. Kellerer, V.A. Strusevich, Scheduling parallel dedicated machines under a single non-shared resource, European J. Oper. Res., 174 (2003) 345\u2013364.","DOI":"10.1016\/S0377-2217(02)00246-1"},{"key":"10.1016\/S0166-218X(03)00433-5_BIB10","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","article-title":"On preemptive scheduling of unrelated parallel processors by linear programming","volume":"25","author":"Lawler","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB11","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 455\u2013522.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0166-218X(03)00433-5_BIB12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585871","article-title":"Makespan minimization in open shops","volume":"82","author":"Sevastianov","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00433-5_BIB13","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","article-title":"Improved approximation algorithms for shop scheduling problems","volume":"23","author":"Shmoys","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB14","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0305-0548(93)90115-Y","article-title":"Two-machine open shop scheduling problem with setup, processing and removal times separated","volume":"20","author":"Strusevich","year":"1993","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00433-5_BIB15","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","article-title":"Short shop schedules","volume":"45","author":"Williamson","year":"1997","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004335?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004335?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T12:26:03Z","timestamp":1585225563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03004335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0166218X03004335"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00433-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}