{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:09:24Z","timestamp":1772824164632,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-218x(00)00176-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:45Z","timestamp":1027651125000},"page":"259-269","source":"Crossref","is-referenced-by-count":80,"title":["Parallel machine scheduling with splitting jobs"],"prefix":"10.1016","volume":"103","author":[{"given":"Wenxun","family":"Xing","sequence":"first","affiliation":[]},{"given":"Jiawei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0166-218X(00)00176-1_BIB1","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1137\/0222078","article-title":"A better heuristic for preemptive parallel machine scheduling with setup times","volume":"22","author":"Chen","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","article-title":"Worst-case analysis of heuristic algorithms","volume":"26","author":"Fisher","year":"1980","journal-title":"Magt. Sci."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.26.1.3","article-title":"Performance guarantees for scheduling algorithms","volume":"26","author":"Garey","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB5","unstructured":"J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University for California, Los Angeles, 1955."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(00)00176-1_BIB7","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1108\/01443579710159932","article-title":"New trends in parallel machine scheduling","volume":"17","author":"Lam","year":"1997","journal-title":"Internat. J. Oper. Production Management"},{"key":"10.1016\/S0166-218X(00)00176-1_BIB8","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, Recent results in the theory of machine scheduling, Mathematical Programming the State of the Art \u2013 Bonn 1982, Springer, Berlin, 1983, pp. 202\u2013234.","DOI":"10.1007\/978-3-642-68874-4_9"},{"key":"10.1016\/S0166-218X(00)00176-1_BIB9","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","article-title":"On preemptive scheduling of unrelated parallel processors by linear programming","volume":"25","author":"Lawler","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB10","series-title":"Logistics of Production and Inventory","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(00)00176-1_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with Deadlines and Loss Functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"issue":"5","key":"10.1016\/S0166-218X(00)00176-1_BIB12","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.41.5.981","article-title":"Analysis of heuristics for preemptive parallel machine scheduling with job setup times","volume":"41","author":"Monma","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB13","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job, one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Sci."},{"issue":"5","key":"10.1016\/S0166-218X(00)00176-1_BIB14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","article-title":"Integrating scheduling with batching and lotsizing: a review of algorithms and complexity","volume":"43","author":"Potts","year":"1992","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"10.1016\/S0166-218X(00)00176-1_BIB15","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.44.4.617","article-title":"Scheduling jobs on several machines with the job splitting property","volume":"44","author":"Serafini","year":"1996","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(00)00176-1_BIB17","first-page":"30","article-title":"Splitting parallel machine scheduling (in Chinese)","volume":"2","author":"Xing","year":"1998","journal-title":"Oper. Res. Trans."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001761?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:02:50Z","timestamp":1580875370000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X00001761"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00176-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}