{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:57:12Z","timestamp":1761487032424},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00249-2","type":"journal-article","created":{"date-parts":[[2003,9,11]],"date-time":"2003-09-11T21:10:28Z","timestamp":1063314628000},"page":"607-619","source":"Crossref","is-referenced-by-count":10,"title":["On the open-shop problem with preemption and minimizing the average completion time"],"prefix":"10.1016","volume":"157","author":[{"given":"Heidemarie","family":"Br\u00e4sel","sequence":"first","affiliation":[]},{"given":"Holger","family":"Hennes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00249-2_BIB1","unstructured":"H. Br\u00e4sel, M. Harborth, T. Tautenhahn, P. Willenius, LiSA\u2013\u2013A Library of Scheduling Algorithms. Otto-von-Guericke Universit\u00e4t Magdeburg, 2001 Available from http:\/\/lisa.math.uni-magdeburg.de"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018999711765","article-title":"On the solution region for certain scheduling problems with preemption","volume":"83","author":"Br\u00e4sel","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02243845","article-title":"Heuristic constructive algorithms for the n\/m\/O\/Cmax problem","volume":"51","author":"Br\u00e4sel","year":"1993","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB4","series-title":"Scheduling Algorithms","author":"Brucker","year":"2001"},{"issue":"3","key":"10.1016\/S0377-2217(03)00249-2_BIB5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1287\/opre.29.3.511","article-title":"Preemptive scheduling of independent jobs with release and due times on open, flow and job shops","volume":"29","author":"Cho","year":"1881","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1006\/jagm.1993.1002","article-title":"Minimize mean flow time in two-machine open-shops and flow-shops","volume":"14","author":"Du","year":"1990","journal-title":"Journal of Algorithms"},{"issue":"4","key":"10.1016\/S0377-2217(03)00249-2_BIB7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open-shop to minimize finish time","volume":"23","author":"Gonzales","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6377(85)90035-5","article-title":"On the complexity of preemptive open-shop scheduling problems","volume":"4","author":"Liu","year":"1985","journal-title":"Operations Research Letter"},{"issue":"3","key":"10.1016\/S0377-2217(03)00249-2_BIB10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0305-0548(87)90029-3","article-title":"Scheduling ordered open-shop","volume":"14","author":"Liu","year":"1987","journal-title":"Computer and Operations Research"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB11","series-title":"The LEDA User Manual","author":"N\u00e4her","year":"1996"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB12","unstructured":"M. Queyranne, M. Sviridenko, New and improved algorithms for minsum shop scheduling, in: Proceedings of the 11th annaul ACM-SIAM symposium on Discrete Algorithms, San Francisco, 2000, pp. 871\u2013878"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB13","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00249-2_BIB14","unstructured":"P. Willenius, Irreducibility theory of shop-scheduling problems (in German), Ph.D. thesis, Otto-von-Guericke Universit\u00e4t Magdeburg, 2000"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:23:55Z","timestamp":1551047035000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703002492"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00249-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}