scientific article; zbMATH DE number 5049964

MaRDI QIDQ5482513zbMATH OpenFDO

Authors Zrinka Lukač, Kristina Šorić, Višnja Vojvodić Rosenzweig

Publication date 28 August 2006

zbMATH Keywords

capacitated lot sizing problemcapacity limitationsheuristicsLagrangean relaxationovertimesquadratic mixed 0-1 integer programming problemsequence dependent setup timestabu searchtwo machines

Mathematics Subject Classification ID

Boolean programming (90C09) Mixed integer programming (90C11) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
• Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
• A heuristic procedure for the capacitated lot sizing problem with setup carry-over
• A capacitated lot sizing problem with stochastic setup times and overtime
• MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups
• Capacitated lot-sizing with sequence dependent setup costs
• A note on ``the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration

Cited in

(8)

• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• A capacitated lot sizing problem with stochastic setup times and overtime
• A heuristic procedure for the capacitated lot sizing problem with setup carry-over
• A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
• A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
• Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
• Capacitated lot sizing with alternative routings and overtime decisions
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482513)