A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
From MaRDI portal
Publication:439552
DOI10.1016/J.EJOR.2011.11.036zbMATH Open1244.90170DBLPjournals/eor/MullerSP12OpenAlexW2127437378WikidataQ58826366 ScholiaQ58826366MaRDI QIDQ439552FDOQ439552
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Production models (90B30)
Cites Work
- Production Planning by Mixed Integer Programming
- Local branching
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- A general heuristic for vehicle routing problems
- Variable neighborhood search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Scheduling technicians and tasks in a telecommunications company
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Lagrangean relaxation 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
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- 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
- 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
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- An effective heuristic for the CLSP with set-up times
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
Cited In (25)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- Solution approaches for integrated vehicle and crew scheduling with electric buses
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- A matheuristic approach to large-scale avionic scheduling
- Lot-sizing for production planning in a recovery system with returns
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Scheduling identical parallel machines with tooling constraints
- The multi-pickup and delivery problem with time windows
- Battery swap station location-routing problem with capacitated electric vehicles
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
- A survey of adaptive large neighborhood search algorithms and applications
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- The consultation timetabling problem at Danish high schools
- New construction heuristic for capacitated lot sizing problems
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- A matheuristic for the driver scheduling problem with staff cars
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Metaheuristics for the minimum gap graph partitioning problem
Uses Software
Recommendations
- Lagrangean relaxation based heuristics for lot sizing with setup times 👍 👎
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions 👍 👎
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups 👍 👎
- A combined heuristic approach to dynamic lot sizing problems 👍 👎
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times 👍 👎
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times 👍 👎
- Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem 👍 👎
- On heuristics and their performance evaluation for dynamic lot sizing 👍 👎
- 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 👍 👎
This page was built for publication: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439552)
