The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity
- 1 December 1981
- journal article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 13 (4), 294-303
- https://doi.org/10.1080/05695558108974565
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problemJournal of Operations Management, 1981
- Deterministic Production Planning: Algorithms and ComplexityManagement Science, 1980
- Heuristic Procedures for the Single Operation, Multi-Item Loading ProblemA I I E Transactions, 1979
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity ConstraintsManagement Science, 1978
- A Dynamic Lot Sizing Algorithm with Capacity ConstraintsA I I E Transactions, 1975
- A Lower Bounding Structure for Lot-Size Scheduling ProblemsOperations Research, 1975
- A Multiple-Product Sales Force Allocation ModelManagement Science, 1971
- State-Dependent System Residence times for time Shared QueuesManagement Science, 1971
- An economic lot-sizing technique, I: The part-period algorithmIBM Systems Journal, 1968
- Optimal Programming of Lot Sizes, Inventory and Labor AllocationsManagement Science, 1965