A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
From MaRDI portal
Publication:439552
DOI10.1016/j.ejor.2011.11.036zbMath1244.90170WikidataQ58826366 ScholiaQ58826366MaRDI QIDQ439552
Laurent Flindt Muller, David Pisinger, Simon Spoorendonk
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/7d0877b8-4aa7-4a77-aff3-5d068b49b3fe
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B30: Production models
90C27: Combinatorial optimization
90B05: Inventory, storage, reservoirs
Related Items
Lot-sizing for production planning in a recovery system with returns, Battery swap station location-routing problem with capacitated electric vehicles, Heuristics for the multi-item capacitated lot-sizing problem with lost sales, An adaptive large neighborhood search for an E-grocery delivery routing problem, A matheuristic for the driver scheduling problem with staff cars, The multi-pickup and delivery problem with time windows, Scheduling identical parallel machines with tooling constraints, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry, Decomposition methods for the lot-sizing and cutting-stock problems in paper industries, The consultation timetabling problem at Danish high schools, Adaptive large neighborhood search for the curriculum-based course timetabling problem, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
Uses Software
Cites Work
- Scheduling technicians and tasks in a telecommunications company
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- A general heuristic for vehicle routing problems
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Variable neighborhood search
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- An effective heuristic for the CLSP with set-up times
- Production Planning by Mixed Integer Programming
