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

DOI10.1016/0305-0548(95)00050-XzbMath0859.90067OpenAlexW2048316943MaRDI QIDQ2563873

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

lot-sizinglimit production capacity

Mathematics Subject Classification ID

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

Related Items (3)

Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ 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.

Uses Software

• LINDO

Cites Work

• A quick and effective method for capacitated lot sizing with startup and reservation costs
• 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
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Deterministic Production Planning: Algorithms and Complexity

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