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

J. G. Madigan
Additional contact information
J. G. Madigan: Sydney, Australia

Management Science, 1968, vol. 14, issue 11, 713-719

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."

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.14.11.713 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:14:y:1968:i:11:p:713-719

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().