A quick and effective method for capacitated lot sizing with startup and reservation costs

DOI10.1016/0305-0548(94)00039-BzbMath0827.90061OpenAlexW2114402324MaRDI QIDQ1892673

Mark A. McKnew, B. Jay Coleman

Publication date: 19 June 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00039-b

zbMATH Keywords

capacitated long production run environmentssingle-item production lot sizeszero-one integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30)

Related Items (3)

Single-item dynamic lot-sizing problems: an updated survey ⋮ Efficient solutions for special zero-one programming problems ⋮ A user interactive heuristic procedure for solving the multiple product cycling problem

Cites Work

• Unnamed Item
• Dynamic Version of the Economic Lot Size Model
• Sequential Production Planning Over Time at Minimum Cost
• The Deterministic Dynamic Product Cycling Problem
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs

This page was built for publication: A quick and effective method for capacitated lot sizing with startup and reservation costs