A simple lower bound to the dynamic assembly problem

DOI10.1016/0377-2217(94)90088-4zbMath0806.90053OpenAlexW1973918324MaRDI QIDQ1331621

Derek Atkins

Publication date: 21 August 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90088-4

zbMATH Keywords

lower boundmultilevel lotsizingdynamic deterministic demandmulti- stage assembly problem

Mathematics Subject Classification ID

Production models (90B30)

Related Items

Knowledge You Can Act on: Optimal Policies for Assembly Systems with Expediting and Advance Demand Information ⋮ Lot sizing and scheduling -- survey and extensions

Cites Work

• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Dynamic Lot Size Models for Multi-Stage Assembly Systems
• A Facilities in Series Inventory Model with Nested Schedules