{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:26:17Z","timestamp":1778581577448,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":5038,"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":[[1999,10]]},"DOI":"10.1016\/s0166-218x(99)00113-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"131-145","source":"Crossref","is-referenced-by-count":15,"title":["Earliness and tardiness scheduling problems on a batch processor"],"prefix":"10.1016","volume":"98","author":[{"given":"Xiangtong","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengsheng","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00113-4_BIB1","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","article-title":"Batching and scheduling jobs on batch and discrete processors","volume":"40","author":"Ahmadi","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB3","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","article-title":"Minimizing total completion time on batch processing machines","volume":"31","author":"Chandru","year":"1993","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","article-title":"Minimizing total completion time on a batch processing machine with job families","volume":"13","author":"Chandru","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/S0377-2217(96)00096-3","article-title":"Scheduling with batch setup times and earliness-tardiness penalties","volume":"96","author":"Chen","year":"1997","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One-processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","article-title":"Efficient scheduling algorithms for a single batch processing machine","volume":"5","author":"Ikura","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(95)00116-6","article-title":"Single-machine scheduling with time windows and earliness\/tardiness penalties","volume":"91","author":"Koulamas","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.1993.tb00102.x","article-title":"Common due-window scheduling","volume":"2","author":"Kramer","year":"1993","journal-title":"Prod. Oper. Mgmt."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB10","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","article-title":"Scheduling with agreeable release times and due dates on a batch processing machine","volume":"96","author":"Li","year":"1997","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB11","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","article-title":"Efficient algorithms for scheduling semi-conductor burn-in operations","volume":"40","author":"Lee","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/07408179808966448","article-title":"Minimizing total tardiness on a batch processing machine with incompatible job families","volume":"30","author":"Mehta","year":"1998","journal-title":"IIE Trans."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB13","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1057\/jors.1996.41","article-title":"Single machine scheduling with a common delivery window","volume":"47","author":"Ventura","year":"1996","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB14","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","article-title":"Scheduling groups of jobs on a single machine","volume":"43","author":"Webster","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB15","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1080\/00207549508904839","article-title":"Scheduling batch processing machines with incompatible job families","volume":"33","author":"Uzsoy","year":"1995","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S0166-218X(99)00113-4_BIB16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/j.1937-5956.1997.tb00415.x","article-title":"Minimizing total weighted completion time on a single batch processing machine","volume":"6","author":"Uzsoy","year":"1997","journal-title":"Prod. Oper. Mgmt."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:54:48Z","timestamp":1556132088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0166218X99001134"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00113-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}