{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:44:35Z","timestamp":1751877875556},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":[[1997,3]]},"DOI":"10.1016\/s0020-0190(97)00037-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"297-301","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling chains to minimize mean flow time"],"prefix":"10.1016","volume":"61","author":[{"given":"Moshe","family":"Dror","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Dell'Olmo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00037-9_BIB1","series-title":"Scheduling in Computer and Manufacturing Systems","author":"Blazewicz","year":"1993"},{"key":"10.1016\/S0020-0190(97)00037-9_BIB2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00037-9_BIB3","article-title":"\u2018Strong\u2019-\u2018Weak\u2019 chain constrained scheduling","author":"Dell'Olmo","year":"1993"},{"key":"10.1016\/S0020-0190(97)00037-9_BIB4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","article-title":"Scheduling chainstructured tasks to minimize makespan and mean flow time","volume":"92","author":"Du","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0020-0190(97)00037-9_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00037-9_BIB6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","article-title":"New results on the completion time variance minimization","volume":"58","author":"Kubiak","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00037-9_BIB7","series-title":"Logistics of Production and Inventory","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T06:26:50Z","timestamp":1556260010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0020019097000379"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00037-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}