A cyclical scheduling heuristic for lot sizing with capacity constraints

DOI10.1080/00207548408942499zbMath0542.90055MaRDI QIDQ3330960

Harish C. Bahl, Larry P. Ritzman

Publication date: 1984

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

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

zbMATH Keywords

heuristic procedure; cyclical scheduling; near optimal solutions; lot sizing with capacity constraints

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B05: Inventory, storage, reservoirs

Related Items

An analysis of multi-level lot-sizing problems with a bottleneck under a rolling schedule environment, Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems, Modeling industrial lot sizing problems: a review, Multilevel capacitated lotsizing complexity and LP-based heuristics, Multi-stage production-inventory systems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Set partitioning and column generation heuristics for capacitated dynamic lotsizing, A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly, New lot sizing heuristics for demand and price uncertainties with service-level constraint, A heuristic for multi-level lot-sizing problems with a bottleneck

Cites Work

• Generalized upper bounding techniques
• An Efficient Algorithm for Multi-Item Scheduling