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

DOI10.1016/j.cor.2022.105928OpenAlexW3134024545MaRDI QIDQ2676332

Yijun Li, Emrah Demir, David S. W. Lai, Nico P. 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

constructive heuristicsself-adaptivecapacitated lot sizing problemlot elimination heuristicperiod-by-period heuristicperturbation strategy

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

New construction heuristic for capacitated lot sizing problems

Cites Work

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

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