The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

Fayez Fouad Boctor
Additional contact information
Fayez Fouad Boctor: Institut d'Administration des Entreprises, Aix-en-Provence, France

Management Science, 1982, vol. 28, issue 7, 798-807

Abstract: In this paper, we deal with the two-product, single-machine, static demand, infinite horizon lot scheduling problem. After a quick review of the literature, the necessary and sufficient conditions for feasibility are derived without imposing any preliminary requirements. Then, an optimal solution algorithm is presented. Finally, we show that a necessary condition for the feasibility of N-product schedules is that each cycle time be an integer multiple of some basic cycle time.

Keywords: inventory/production: deterministic models; inventory/production: planning horizons; production/scheduling (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.28.7.798 (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:28:y:1982:i:7:p:798-807

Access Statistics for this article

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