Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
From MaRDI portal
Publication:547140
DOI10.1016/j.cor.2011.02.005zbMath1215.90027OpenAlexW2100711261MaRDI QIDQ547140
Ross J. W. James, Bernardo Almada-Lobo
Publication date: 30 June 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.005
local searchparallel machinemixed integer programmingmetaheuristicsequence-dependent setuprelax-and-fixCLSD-PM
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry ⋮ Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Modeling lotsizing and scheduling problems with sequence dependent setups ⋮ New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups ⋮ A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem ⋮ Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Mathematical programming-based approaches for multi-facility Glass container production planning ⋮ On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties ⋮ A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding ⋮ Optimization model for a production, inventory, distribution and routing problem in small furniture companies ⋮ HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry ⋮ A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Pricing, relaxing and fixing under lot sizing and scheduling
Cites Work
- Capacitated lot-sizing with extensions: a review
- A proposal for a hybrid meta-strategy for combinatorial optimization problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- Capacitated lot-sizing with sequence dependent setup costs
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Lot sizing and furnace scheduling in small foundries
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Computational Complexity of the Capacitated Lot Size Problem
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- Production Planning by Mixed Integer Programming
