Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
From MaRDI portal
(Redirected from Publication:635174)
Recommendations
- Solving multi-level capacitated lot sizing problems via a fix-and-optimize approach
- An MIP-based interval heuristic for the capacitated multi-level 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
- scientific article; zbMATH DE number 6129056
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
Cites work
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A heuristic approach for big bucket multi-level production planning problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Capacitated lot-sizing with sequence dependent setup costs
- Efficient reformulations for dynamic lot-sizing problems with product substitution
- 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
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- The general lotsizing and scheduling problem
- The traveling salesman problem and its variations
Cited in
(17)- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- Robust optimization for a steel production planning problem with uncertain demand and product substitution
- Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- scientific article; zbMATH DE number 5049964 (Why is no real title available?)
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
- Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry
- The green capacitated multi-item lot sizing problem with parallel machines
- Efficient approximate algorithms for a class of dynamic lot size problems under product substitution
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
- Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Capacitated lot-sizing with sequence dependent setup costs
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
This page was built for publication: Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635174)
