{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:03Z","timestamp":1759063443030},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0020-0190(01)00136-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:08:51Z","timestamp":1027631331000},"page":"291-296","source":"Crossref","is-referenced-by-count":21,"title":["A heuristic algorithm for minimizing mean flow time with unit setups"],"prefix":"10.1016","volume":"79","author":[{"given":"Svetlana A.","family":"Kravchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00136-3_BIB001","series-title":"Osnabr\u00fccker Schriften zur Mathematik, Reihe P, Heft 219","article-title":"Complexity results for parallel machine problems with a single server","author":"Brucker","year":"2000"},{"key":"10.1016\/S0020-0190(01)00136-3_BIB002","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic machine scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"10.1016\/S0020-0190(01)00136-3_BIB003","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 Appl. Math."},{"key":"10.1016\/S0020-0190(01)00136-3_BIB004","series-title":"Scheduling on two parallel machines for minimizing machine interference, Working Paper","author":"Koulamas","year":"1993"},{"issue":"12","key":"10.1016\/S0020-0190(01)00136-3_BIB005","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":"Math. Comput. Modelling"},{"key":"10.1016\/S0020-0190(01)00136-3_BIB006","unstructured":"S.A. Kravchenko, F. Werner, Scheduling on parallel machines with a single server, Otto-von-Guericke-Universit\u00e4t Magdeburg, FMA, Preprint 30\/98, 1998"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T17:26:39Z","timestamp":1555781199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0020019001001363"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00136-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}