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

DOI10.1016/0305-0548(94)00039-BMaRDI QIDQ1892673zbMATH OpenOpenAlexFDO

Authors B. Jay Coleman, Mark A. McKnew

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

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

Recommendations

• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
• An effective algorithm for the capacitated single item lot size problem
• Facets and algorithms for capacitated lot sizing
• Lot-sizing with start-up times

Cites work

• Dynamic version of the economic lot size model
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Sequential production planning over time at minimum cost
• The Deterministic Dynamic Product Cycling Problem
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs

Cited in

(7)

• A cutting plane approach to capacitated lot-sizing with start-up costs
• Single-item dynamic lot-sizing problems: an updated survey
• A user interactive heuristic procedure for solving the multiple product cycling problem
• Lot-sizing with start-up times
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• Efficient solutions for special zero-one programming problems

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

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