July 1, 1968

Scheduling a Multi-Product Single Machine System for an Infinite Planning Period

Key Points

Key points are not available for this paper at this time.

Abstract

This paper describes an easy to apply method of solving the “Single Machine Multi-Product Lot Size Scheduling Problem for an Infinite Planning Period.”

KI fragen

Bookmark

Cite This Study

J. G. Madigan (Mon,) studied this question.

synapsesocial.com/papers/6a20c6e25bbe57fdd19a87a1 https://doi.org/https://doi.org/10.1287/mnsc.14.11.713

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A Dynamic Programming Approach to a Lot Size Scheduling Problem1966 · 300 citations
2Operations Research in Production and Inventory Control1962 · 189 citations
3Production planning and inventory control1958 · 367 citations
4Elements of Production Planning and Control1963 · 110 citations
5A Computational Approach to the Economic Lot Scheduling Problem1958 · 170 citations

KI fragen

Bookmark