MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups

DOI10.1080/00207540902796016zbMath1197.90221OpenAlexW2025999952MaRDI QIDQ3163316

No author found.

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540902796016

zbMATH Keywords

lotsizing and schedulingrelax-and-fixsequence-dependentMIP-based algorithmpure flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating ⋮ Joint energy capacity and production planning optimization in flow-shop systems ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems

Cites Work

• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Lot sizing and scheduling -- survey and extensions
• On practical resource allocation for production planning and scheduling with period overlapping setups
• The general lotsizing and scheduling problem
• A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• Single machine multi-product capacitated lot sizing with sequence-dependent setups

This page was built for publication: MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups