{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:59:09Z","timestamp":1771005549112,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":[[2002,8]]},"DOI":"10.1016\/s0020-0190(01)00331-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"229-235","source":"Crossref","is-referenced-by-count":3,"title":["A polynomial algorithm for lot-size scheduling of two type tasks"],"prefix":"10.1016","volume":"83","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Pattloch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00331-3_BIB001","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"Omega"},{"key":"10.1016\/S0020-0190(01)00331-3_BIB002","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/0377-2217(95)00074-7","article-title":"A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem","volume":"91","author":"Blocher","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB003","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1018912114491","article-title":"Batch scheduling with deadlines on parallel machines","volume":"83","author":"Brucker","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB004","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","article-title":"Complexity of task sequencing with deadlines, set-up times and changeover costs","volume":"7","author":"Bruno","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB005","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1287\/opre.48.5.788.12405","article-title":"High multiplicity in earliness-tardiness scheduling","volume":"48","author":"Clifford","year":"2000","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB006","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/PL00011403","article-title":"Parallel machine scheduling with high multiplicity","volume":"89","author":"Clifford","year":"2001","journal-title":"Math. Programming, Ser. A"},{"key":"10.1016\/S0020-0190(01)00331-3_BIB007","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1080\/05695557708975171","article-title":"Scheduling production on one machine with change-over costs","volume":"9","author":"Driscoll","year":"1977","journal-title":"AIIE Trans."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB008","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(01)00331-3_BIB009","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.16.2.342","article-title":"Minimum change-over scheduling of several products on one machine","volume":"16","author":"Glassey","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB010","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-218X(90)90093-R","article-title":"Minimizing the number of tardy job units under release time constraints","volume":"28","author":"Hochbaum","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB011","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","article-title":"Strongly polynomial algorithms for the high multiplicity scheduling problem","volume":"39","author":"Hochbaum","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB012","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.35.1.94","article-title":"Some optimum algorithms for scheduling problems with changeover costs","volume":"35","author":"Hu","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB013","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0166-218X(97)00138-8","article-title":"Uniform machine scheduling of unit-time jobs subject to resource constraints","volume":"84","author":"Kovalyov","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB014","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","article-title":"A strong cutting plane algorithm for production scheduling with changeover costs","volume":"38","author":"Magnanti","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB015","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TSMC.1972.4309158","article-title":"Optimal production scheduling of multicommodity in flow line","volume":"2","author":"Mitsumori","year":"1972","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB016","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0166-218X(95)00044-R","article-title":"Lot-size scheduling of two types of jobs on identical machines","volume":"65","author":"Pattloch","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB017","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0360-8352(01)00004-3","article-title":"Heuristic algorithms for lotsize scheduling with application in the tobacco industry","volume":"39","author":"Pattloch","year":"2001","journal-title":"Comput. Industrial Engrg."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB018","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","article-title":"Scheduling with batching: A review","volume":"120","author":"Potts","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB019","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. Oper. Res. Soc."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB020","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0166-218X(96)00106-0","article-title":"A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem","volume":"77","author":"Timkovsky","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB021","series-title":"Machine Scheduling Problems","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/S0020-0190(01)00331-3_BIB022","series-title":"Deterministic Lotsizing Models for Production Planning","volume":"355","author":"Salomon","year":"1991"},{"key":"10.1016\/S0020-0190(01)00331-3_BIB023","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","article-title":"A polynomial algorithm for a one machine batching problem","volume":"11","author":"Shallcross","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(01)00331-3_BIB024","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1287\/opre.46.3.423","article-title":"A note on \u201cParallel machine scheduling with batch setup times\u201d","volume":"46","author":"Webster","year":"1998","journal-title":"Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003313?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003313?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T08:28:48Z","timestamp":1556872128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0020019001003313"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00331-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}