{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:41:09Z","timestamp":1648932069099},"reference-count":19,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1016\/s0305-0548(00)00055-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:07:21Z","timestamp":1027631241000},"page":"1441-1460","source":"Crossref","is-referenced-by-count":9,"title":["The peak load minimization problem in cyclic production"],"prefix":"10.1016","volume":"28","author":[{"given":"Ming-Jong","family":"Yao","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00055-1_BIB1","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.24.6.587","article-title":"The Economic Lot Scheduling Problem (ELSP): review and extension","volume":"24","author":"Elmaghraby","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0925-5273(91)90058-2","article-title":"The economic lot scheduling problem: theory and practice","volume":"23","author":"Lopez","year":"1991","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB3","unstructured":"Yao MJ. The economic lot scheduling problem with extension to multiple resource constraints. Unpublished Ph.D. dissertation, North Carolina State University, Raleigh, North Carolina, USA, 1999."},{"key":"10.1016\/S0305-0548(00)00055-1_BIB4","first-page":"387","article-title":"Comments on the two-product, single-machine, static demand, infinite horizon lot scheduling problem","volume":"39","author":"Chen","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB5","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.22.8.909","article-title":"A note on the single machine multi-product lot scheduling problem","volume":"22","author":"Haessler","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB6","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1080\/05695557908974480","article-title":"An improved extended basic period procedure for solving the economic lot scheduling problem","volume":"11","author":"Haessler","year":"1979","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB7","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1287\/mnsc.36.8.985","article-title":"Scheduling economic lot size production runs","volume":"36","author":"Davis","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1080\/07408178408975256","article-title":"A stepwise partial enumeration algorithm for the economic lot scheduling problem","volume":"16","author":"Park","year":"1984","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1080\/00207548708919847","article-title":"The G-group heuristic for single machine lot scheduling","volume":"25","author":"Boctor","year":"1987","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB10","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1002\/1520-6750(198808)35:4<605::AID-NAV3220350412>3.0.CO;2-V","article-title":"Two heuristics for the economic lot scheduling problem: an experimental study","volume":"35","author":"Geng","year":"1988","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB11","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.35.5.764","article-title":"The economic lot-scheduling problem: achieving feasibility using time-varying lot sizes","volume":"35","author":"Dobson","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB12","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/opre.39.1.56","article-title":"Computing optimal lot sizes in the economic lot scheduling problem","volume":"39","author":"Zipkin","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/mnsc.20.1.50","article-title":"An iterative procedure for the single-machine multi-product lot scheduling problem","volume":"20","author":"Doll","year":"1973","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1080\/05695558308974640","article-title":"The effect of restricting cycle times in the economic lot scheduling problem","volume":"15","author":"Maxwell","year":"1983","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB15","unstructured":"Martello, S, Toth P. Knapsack problems: algorithms and computer implementations. Singapore: Wiley, 1990, Chapter 8: Bin packing problem."},{"key":"10.1016\/S0305-0548(00)00055-1_BIB16","doi-asserted-by":"crossref","unstructured":"Coffman EG, Garey MR, Johnson DS. Approximation algorithms for bin-packing \u2013 an updated survey. In: Ausiello G, Lucertini M, Serafini P. editors. Algorithm design for computer system design. Vienna: Springer, 1984. p. 49\u2013106.","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB17","series-title":"Scheduling: theory, algorithms, and systems","author":"Pinedo","year":"1993"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB18","series-title":"Applied linear statistical models","author":"Neter","year":"1996"},{"key":"10.1016\/S0305-0548(00)00055-1_BIB19","unstructured":"Elmaghraby SE. An extended basic period approach to the ELSP. Report No. 115, Graduate Program in Operations Research, North Carolina State University, 1977."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T17:52:24Z","timestamp":1555782744000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":19,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S0305054800000551"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00055-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}