{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:09:18Z","timestamp":1676851758644},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":[[1999,3]]},"DOI":"10.1016\/s0020-0190(99)00026-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"275-281","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling groups of unit length jobs on two identical parallel machines"],"prefix":"10.1016","volume":"69","author":[{"given":"Zhaohui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Wenci","family":"Yu","sequence":"additional","affiliation":[]},{"given":"T.C.Edwin","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00026-5_BIB1","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.42.6.1171","article-title":"Parallel machine scheduling with batch setup times","volume":"42","author":"Cheng","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(99)00026-5_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(99)00026-5_BIB3","series-title":"Logistics of Production and Inventory","first-page":"445","article-title":"Sequencing and scheduling: Algorithms and complexity","volume":"Vol 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0020-0190(99)00026-5_BIB4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/S0020-0190(99)00026-5_BIB5","article-title":"Scheduling groups of jobs and scheduling batch processing machines","author":"Liu","year":"1998"},{"key":"10.1016\/S0020-0190(99)00026-5_BIB6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","article-title":"Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity","volume":"43","author":"Potts","year":"1992","journal-title":"J. Opl. Res. Soc."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099000265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099000265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:27:07Z","timestamp":1556274427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099000265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0020019099000265"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00026-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}