{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:56:31Z","timestamp":1770994591090,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0305-0548(00)00074-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:00:41Z","timestamp":1027616441000},"page":"295-315","source":"Crossref","is-referenced-by-count":65,"title":["Scheduling parallel machines with a single server: some solvable cases and heuristics"],"prefix":"10.1016","volume":"29","author":[{"given":"Amir H.","family":"Abdekhodaee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00074-5_BIB1","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1080\/00207548808947963","article-title":"Look-ahead scheduling for minimizing machine interference","volume":"26","author":"Koulamas","year":"1988","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB2","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"},{"issue":"10","key":"10.1016\/S0305-0548(00)00074-5_BIB3","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/0305-0548(96)00011-1","article-title":"Scheduling two parallel semiautomatic machines to minimize machine interference","volume":"23","author":"Koulamas","year":"1996","journal-title":"Computers and Operations Research"},{"issue":"12","key":"10.1016\/S0305-0548(00)00074-5_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","article-title":"Parallel machine scheduling problems with a single server","volume":"26","author":"Kravchenko","year":"1997","journal-title":"Mathematical and Computer Modelling (Oxford)"},{"issue":"5","key":"10.1016\/S0305-0548(00)00074-5_BIB5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1080\/07408179408966628","article-title":"Parallel machine scheduling with fractional operator requirements","volume":"26","author":"Bourland","year":"1994","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB6","doi-asserted-by":"crossref","unstructured":"Blazewicz J, Ecker KH, Schmidt G, Weglarz J. Scheduling in computer and manufacturing systems, 2nd Edition (revised). Berlin: Springer, 1994.","DOI":"10.1007\/978-3-642-79034-8"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB7","series-title":"Handbooks in OR & MS","first-page":"4","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB8","series-title":"Heuristic scheduling systems: with applications to production systems and project management","author":"Morton","year":"1993"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.20.1.24","article-title":"Single server, two-machine sequencing with switching time","volume":"20","author":"Sahney","year":"1972","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(00)00074-5_BIB10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0272-6963(84)90030-5","article-title":"Two heuristics for the deterministic, single operator, multiple machine, multiple run cyclic scheduling problem","volume":"4","author":"Aronson","year":"1984","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB11","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(00)00074-5_BIB12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state variable machine: a solvable case of the travelling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:23:40Z","timestamp":1556191420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0305054800000745"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00074-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}