{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T13:39:13Z","timestamp":1770471553066,"version":"3.49.0"},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0377-2217(97)00270-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"509-524","source":"Crossref","is-referenced-by-count":96,"title":["The use of genetic algorithms to solve the economic lot size scheduling problem"],"prefix":"10.1016","volume":"110","author":[{"given":"Moutaz","family":"Khouja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zgibniew","family":"Michalewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wilmot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00270-1_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0360-8352(90)90082-W","article-title":"Genetic algorithms and job shop scheduling","volume":"19","author":"Biegel","year":"1990","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB2","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1287\/mnsc.12.11.778","article-title":"A dynamic programming approach to a lot size scheduling problem","volume":"12","author":"Bomberger","year":"1966","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0360-8352(94)00188-S","article-title":"Buffer size optimization in asynchronous assembly systems using genetic algorithms","volume":"28","author":"Bulgak","year":"1995","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","article-title":"An application of genetic algorithms for flow shop problems","volume":"80","author":"Chen","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB5","series-title":"Genetic Algorithms and Simulated Annealing","author":"Davis","year":"1987"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB6","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1287\/mnsc.36.8.985","article-title":"Scheduling economic lot size (ELS) production runs","volume":"36","author":"Davis","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB7","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1287\/mnsc.23.10.1070","article-title":"Lot sizing and sequencing for N products and one facility","volume":"23","author":"Delporte","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB8","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\/S0377-2217(97)00270-1_BIB9","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\/S0377-2217(97)00270-1_BIB10","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.24.6.587","article-title":"The economic lot scheduling problem (ELSP): review and extensions","volume":"24","author":"Elmaghraby","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB11","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1080\/00207549308956774","article-title":"Reduced production rates in the economic lot scheduling problem","volume":"31","author":"Gallego","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB12","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1002\/1520-6750(199208)39:5<729::AID-NAV3220390510>3.0.CO;2-N","article-title":"The extended economic lot scheduling problem","volume":"39","author":"Gallego","year":"1992","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB13","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/opre.40.3.614","article-title":"The effect of externalizing setups in the economic lot scheduling problem","volume":"40","author":"Gallego","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB14","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1002\/1520-6750(199508)42:5<773::AID-NAV3220420505>3.0.CO;2-F","article-title":"Strategic investment to reduce setups times in the economic lot scheduling problem","volume":"42","author":"Gallego","year":"1995","journal-title":"Naval research logistics"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB15","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1287\/mnsc.38.10.1482","article-title":"Feasibility of scheduling lot sizes of three products on one machine","volume":"38","author":"Glass","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB16","series-title":"Operation Research in Production and Inventory","author":"Hanssmann","year":"1962"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB17","series-title":"Production and Inventory Management","author":"Hax","year":"1984"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB18","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.29.1.93","article-title":"On the general feasibility test of scheduling lot sizes for several products on one machine","volume":"29","author":"Hsu","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/07408179608966253","article-title":"Manufacturing cell design: an integer programming approach employing genetic algorithms","volume":"28","author":"Joines","year":"1996","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB21","series-title":"Proceedings of the Sixth International Conference on Genetic Algorithms","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"Jones","year":"1995"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/07408178908966202","article-title":"When is the economic lot scheduling problem easy","volume":"21","author":"Jones","year":"1989","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB23","first-page":"332","article-title":"PROGENITOR: a genetic algorithm for production scheduling","volume":"33","author":"Kanet","year":"1991","journal-title":"Wirtschaftsinformatik"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0925-5273(96)00064-3","article-title":"The economic lot scheduling problem under volume flexibility, forthcoming","volume":"48","author":"Khouja","year":"1997","journal-title":"The International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB25","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1111\/j.1937-5956.1995.tb00042.x","article-title":"Setup reduction and machine availability","volume":"4","author":"Kim","year":"1995","journal-title":"Production and Operations Management"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB26","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1111\/j.1540-5915.1994.tb01861.x","article-title":"Assembly line balancing using genetic algorithms with heuristic-rated initial populations and multiple evaluation criteria","volume":"25","author":"Leu","year":"1994","journal-title":"Decision Sciences"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB27","first-page":"1155","article-title":"The optimality of the zero-switch rule for a class of economic lot scheduling problems","volume":"39","author":"Matthew","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/nav.3800110202","article-title":"The scheduling of economic lot sizes","volume":"11","author":"Maxwell","year":"1964","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB29","series-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Michalewicz","year":"1996"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB30","doi-asserted-by":"crossref","first-page":"2459","DOI":"10.1080\/00207549108948096","article-title":"Controllable production rates in a family production context","volume":"29","author":"Moon","year":"1991","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB31","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flow shop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB32","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1287\/mnsc.35.12.1433","article-title":"Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems","volume":"35","author":"Roundy","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB33","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207549008942681","article-title":"Deliberately slowing down output in a family production context","volume":"29","author":"Silver","year":"1990","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB34","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/0360-8352(94)90336-0","article-title":"A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell","volume":"27","author":"Sridhar","year":"1994","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB35","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1287\/mnsc.24.15.1668","article-title":"On the feasibility of scheduling lot sizes for two products on one machine","volume":"24","author":"Vemuganti","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB36","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0007-8506(07)62237-9","article-title":"Decentral production scheduling of assembly systems with genetic algorithms","volume":"34","author":"Wiendahl","year":"1994","journal-title":"Annals of CIRP"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB37","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/07408179608966252","article-title":"A genetic algorithm application for sequencing operations in process planning for parallel machining","volume":"28","author":"Yip-hoi","year":"1996","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00270-1_BIB38","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"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:59:07Z","timestamp":1556657947000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0377221797002701"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00270-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}