Designing new heuristics for the capacitated lot sizing problem by genetic programming

DOI10.1016/j.cor.2018.03.006zbMath1458.90018MaRDI QIDQ1652648

Bernardo Almada-Lobo, Gonçalo Figueira, Christian Almeder, Fanny Hein

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.03.006

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B05: Inventory, storage, reservoirs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An evaluation of evolutionary generalisation in genetic programming
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
• Capacitated lot-sizing with extensions: a review
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• A heuristic method for lot-sizing in multi-stage systems
• Planning lot sizes and capacity requirements in a single stage production system
• Deriving inventory-control policies with genetic programming
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Dynamic Version of the Economic Lot Size Model
• Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand