The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming
- 15 February 1994
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 48 (3), 289-303
- https://doi.org/10.1016/0166-218x(92)00182-l
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup TimesManagement Science, 1993
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin CaseOperations Research, 1992
- Some Extensions of the Discrete Lotsizing and Scheduling ProblemManagement Science, 1991
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover CostsOperations Research, 1990
- The discrete lot-sizing and scheduling problemEuropean Journal of Operational Research, 1990
- Planning production in a bottleneck departmentEuropean Journal of Operational Research, 1983
- An Efficient Algorithm for Multi-Item SchedulingOperations Research, 1971