{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:53:47Z","timestamp":1770990827813,"version":"3.50.1"},"reference-count":53,"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)00269-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"525-547","source":"Crossref","is-referenced-by-count":63,"title":["Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions"],"prefix":"10.1016","volume":"110","author":[{"given":"Linet","family":"\u00d6zdamar","sequence":"first","affiliation":[]},{"given":"\u015eevket \u0130lker","family":"Birbil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00269-5_BIB1","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1287\/mnsc.32.8.989","article-title":"Heuristics for multilevel lot-sizing with a bottleneck","volume":"32","author":"Billington","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1080\/07408179408966591","article-title":"Multi item lot sizing in capacitated multi-stage serial systems","volume":"26","author":"Billington","year":"1994","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB3","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","article-title":"Computational complexity of the capacitated lot size problem","volume":"28","author":"Bitran","year":"1982","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB4","article-title":"A heuristic approach to the capacitated lot sizing and scheduling problem (with parallel facilities)","author":"Bozyel","year":"1996","journal-title":"Yeditepe University, Department of Systems Engineering (Working Paper)"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(90)90296-N","article-title":"Set partitioning and column generation heuristics for capacitated lotsizing","volume":"46","author":"Cattrysse","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/mnsc.39.4.477","article-title":"A dual ascent and column generation heuristic for the discrete lot sizing and scheduling problem with setup times","volume":"39","author":"Cattrysse","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state of the art review of parallel machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(94)90085-X","article-title":"Integration of lot sizing and scheduling decisions in a job-shop","volume":"75","author":"Dauzerre-Peres","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB9","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TSMC.1980.4308561","article-title":"Adaptive system design: a genetic approach","volume":"SMC-10","author":"De Jong","year":"1980","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB10","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/opre.42.3.492","article-title":"Dynamic production scheduling for a process industry","volume":"42","author":"De Matta","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB11","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1287\/mnsc.38.9.1329","article-title":"A lagrangiean relaxation approach for very large scale capacitated lot sizing","volume":"38","author":"Diaby","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0272-6963(83)90016-5","article-title":"A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities","volume":"3","author":"Dixon","year":"1983","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0272-6963(81)90033-4","article-title":"A heuristic solution procedure for the multi-item single level limited capacity lot sizing problem","volume":"2","author":"Dixon","year":"1981","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB14","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)90195-S","article-title":"Some experiments with simulated annealing techniques for packing problems","volume":"68","author":"Dowsland","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB15","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1080\/00207549608905001","article-title":"Evaluating capacity change and setup time reduction in a capacity constrained joint lot sizing situation","volume":"34","author":"Duplaga","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","article-title":"The discrete lot sizing and scheduling problem","volume":"44","author":"Fleischmann","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB17","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2014 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0305-0548(93)E0023-M","article-title":"Genetic algorithms and tabu search:Hybrids for optimization","volume":"22","author":"Glover","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB21","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB22","article-title":"Optimization of control parameters for genetic algorithms","volume":"SMC-16","author":"Grefenstette","year":"1986","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0377-2217(87)90026-9","article-title":"Planning lot sizes and capacity requirements in a single stage production system","volume":"31","author":"G\u00fcnther","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB24","series-title":"Production and Inventory Management","author":"Hax","year":"1984"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB25","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB26","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/0305-0548(95)00061-5","article-title":"Parallel genetic algorithms with local search","volume":"23","author":"Huntley","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB27","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast Algorithms for Bin Packing","volume":"8","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB28","article-title":"Discrete lot sizing and scheduling by batch sequencing","author":"Jordan","year":"1996","journal-title":"University of Kiel, Kiel (Working Paper)"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB29","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1080\/00207549508904795","article-title":"Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems","volume":"33","author":"Kim","year":"1995","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB30","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB31","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0377-2217(94)90078-7","article-title":"A new heuristic approach for the multi-item dynamic lot sizing problem","volume":"75","author":"Kirca","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0377-2217(91)90320-U","article-title":"On the computational complexity of the (maximum) class scheduling","volume":"54","author":"Kolen","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB33","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1080\/07408179308964266","article-title":"Linear programming, simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems","volume":"25","author":"Kuik","year":"1993","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB34","first-page":"319","article-title":"Heuristic procedure for the single operation multi-item loading problem","volume":"11","author":"Lambrecht","year":"1979","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB35","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0377-2217(91)90130-N","article-title":"Multilevel capacitated lot sizing complexity and LP-based heuristics","volume":"53","author":"Maes","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB36","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0167-6377(86)90027-1","article-title":"A simple heuristic for the multi-item single level capacitated lot sizing problem","volume":"4","author":"Maes","year":"1986","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB37","series-title":"Genetic Algorithms +Data Structures=Evolution Programs","author":"Michalewicz","year":"1994"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB38","series-title":"Local Search in Combinatorial Optimization","article-title":"Evolutionary algorithms: Theory and applications","author":"M\u00fchlenbein","year":"1993"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB39","series-title":"Proceedings of the Fifth International Workshop on Project Management and Scheduling","article-title":"A genetic algorithm approach for the multimode resource-constrained project scheduling problem under general resource categories","author":"\u00d6zdamar","year":"1996"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB40","doi-asserted-by":"crossref","first-page":"2613","DOI":"10.1080\/00207549608905047","article-title":"Heuristic family disaggregation techniques in hierarchical production planning systems","volume":"34","author":"\u00d6zdamar","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB41","series-title":"New results for the capacitated lot sizing problem with overtime decisions and setup times","author":"\u00d6zdamar","year":"1997"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB42","series-title":"The capacitated lot sizing problem with overtime decisions and setup times","author":"\u00d6zdamar","year":"1996"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB43","article-title":"Simultaneous lot sizing and loading of product families on parallel facilities of different classes","author":"\u00d6zdamar","year":"1997","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB44","series-title":"Proceedings of the Workshop on Production Planning and Control","article-title":"Genetic algorithms and scheduling: A state of the art and some propositions","author":"Portmann","year":"1996"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB45","series-title":"Production and Scheduling of Manufacturing Systems","article-title":"Scheduling methodology: Optimization and compu-search approaches I","author":"Portmann","year":"1996"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB46","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/21.259687","article-title":"The development and evaluation of an improved genetic algorithm based on migration and artificial selection","volume":"24","author":"Potts","year":"1994","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB47","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/mnsc.37.7.801","article-title":"Some extensions of the discrete lot sizing and scheduling problem","volume":"37","author":"Salomon","year":"1991","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB48","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms","volume":"24","author":"Srinivas","year":"1994","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB49","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","article-title":"A lagrangean based heuristic for dynamic multi item multi level constrained lot sizing with setup times","volume":"42","author":"Tempelmeier","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB50","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0377-2217(94)90076-0","article-title":"A heuristic for dynamic multi item multi level capacitated lot sizing for general product structures","volume":"75","author":"Tempelmeier","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB51","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1080\/07408178508975308","article-title":"Lagrangian relaxation the multi-item capacitated lotsizing problem: A heuristic implementation","volume":"17","author":"Thizy","year":"1985","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB52","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","article-title":"Capacitated lot sizing with setup times","volume":"35","author":"Trigeiro","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00269-5_BIB53","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/64.236477","article-title":"Managing genetic search in job shop scheduling","volume":"8","author":"Uckun","year":"1993","journal-title":"IEEE Expert"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002695?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002695?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:58:25Z","timestamp":1556110705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0377221797002695"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00269-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}