{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:58:10Z","timestamp":1777607890941,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0377-2217(02)00246-1","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T13:07:53Z","timestamp":1045487273000},"page":"345-364","source":"Crossref","is-referenced-by-count":40,"title":["Scheduling parallel dedicated machines under a single non-shared resource"],"prefix":"10.1016","volume":"147","author":[{"given":"H.","family":"Kellerer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.A.","family":"Strusevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00246-1_BIB1","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":"Blazewicz","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB2","series-title":"Scheduling in Computer and Manufacturing Systems","author":"Blazewicz","year":"1994"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB3","series-title":"Computers and Intractability, A Guide to The Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB4","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 Research Logistics"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB5","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":"Journal of The Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","article-title":"Parallel machine scheduling with a common server","volume":"102","author":"Hall","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB7","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: Algorithms and complexity","volume":"vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB8","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","article-title":"Scheduling with batching: A review","volume":"120","author":"Potts","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585871","article-title":"Makespan minimization in open shops: A polynomial time approximation scheme","volume":"82","author":"Sevastianov","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00246-1_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0167-6377(97)00030-8","article-title":"An open shop scheduling problem with a non-bottleneck machine","volume":"21","author":"Strusevich","year":"1997","journal-title":"Operations Research Letters"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:52:33Z","timestamp":1555152753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0377221702002461"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00246-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}