The setup carryover assignment problem
From MaRDI portal
Publication:6155641
Recommendations
- A heuristic procedure for the capacitated lot sizing problem with setup carry-over
- A framework for modelling setup carryover in the capacitated lot sizing problem
- A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- A modified framework for modelling set-up carryover in the capacitated lotsizing problem
Cites work
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
- Integral boundary points of convex polyhedra
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
- The significance of reducing setup times/setup costs
- The third comprehensive survey on scheduling problems with setup times/costs
- Total unimodularity and combinatorial theorems
Cited in
(3)- A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control
- A modified framework for modelling set-up carryover in the capacitated lotsizing problem
- Feasibility recovery for the unit-capacity constrained permutation problem
This page was built for publication: The setup carryover assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155641)
