Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem

DOI10.1016/J.COR.2022.105928MaRDI QIDQ2676332zbMATH OpenOpenAlexFDO

Authors David S. W. Lai, Yijun Li, Emrah Demir, Nico Dellaert, Tom Van Woensel

Publication date 27 September 2022

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

Full work available at URL https://arxiv.org/abs/2103.04199

zbMATH Keywords

capacitated lot sizing problemconstructive heuristicslot elimination heuristicperiod-by-period heuristicperturbation strategyself-adaptive

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Designing new heuristics for the capacitated lot sizing problem by genetic programming
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• An improved heuristic for the capacitated lot-sizing problem
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing

Cites work

• \(ABC_{\beta }\)-a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
• A computational analysis of lower bounds for big bucket production planning problems
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
• A modified priority index for Günther's lot-sizing heuristic under capacited single stage production
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• A new heuristic approach for the multi-item dynamic lot sizing problem
• A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
• A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
• An effective heuristic for the CLSP with set-up times
• Designing new heuristics for the capacitated lot sizing problem by genetic programming
• Dynamic version of the economic lot size model
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Modelling practical lot-sizing problems as mixed-integer programs
• Multi-item lot size determination and scheduling under capacity constraints
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• Planning lot sizes and capacity requirements in a single stage production system
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
• Semi-greedy heuristics: An empirical study
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Single-item dynamic lot-sizing problems: an updated survey
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Solving the CLSP by a Tabu Search Heuristic
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Tabu Search—Part I
• Tabu Search—Part II
• The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
• The noising methods: A generalization of some metaheuristics
• Worst case analysis of relax and fix heuristics for lot-sizing problems

Cited in

(4)

• Designing new heuristics for the capacitated lot sizing problem by genetic programming
• New construction heuristic for capacitated lot sizing problems
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation

This page was built for publication: Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676332)