A user interactive heuristic procedure for solving the multiple product cycling problem

DOI10.1016/0305-0548(95)00050-XMaRDI QIDQ2563873zbMATH OpenOpenAlexFDO

Authors Richard A. Sandbothe

Publication date 26 January 1997

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

Full work available at URL https://doi.org/10.1016/0305-0548(95)00050-x

zbMATH Keywords

limit production capacitylot-sizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Production models (90B30)

Recommendations

• A cyclical scheduling heuristic for lot sizing with capacity constraints
• The stochastic dynamic product cycling problem
• The Deterministic Dynamic Product Cycling Problem
• A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes

Cites work

• A quick and effective method for capacitated lot sizing with startup and reservation costs
• Deterministic Production Planning: Algorithms and Complexity
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• The Deterministic Dynamic Product Cycling Problem
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs

Cited in

(5)

• Solving mixed integer programming production planning problems with setups by shadow price information.
• Optimization of the stochastic dynamic production cycling problem by a genetic algorithm.
• A cyclical scheduling heuristic for lot sizing with capacity constraints
• The Deterministic Dynamic Product Cycling Problem
• Multiple machine continuous setup lotsizing with sequence-dependent setups

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: A user interactive heuristic procedure for solving the multiple product cycling problem

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