Comments on the Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

Chen Shaoxiang
Additional contact information
Chen Shaoxiang: Departement voor Toegepaste, Economische Wetenshappen, Katholieke Universiteit Leuven, Dekenstraat 2, 3000 Leuven, Belgium

Management Science, 1993, vol. 39, issue 3, 387-388

Abstract: One of the necessary and sufficient conditions derived by F. F. Boctor (1982) for feasibility of a repetitive two-product schedule is that the cycle times (T 1 and T 2 ) must be integer multiples of some time interval T (Propositions 2, 3 and 4). This result also holds for N-product schedules. However, the proof for Propositions 3 and 4 in [1] is not exactly valid and therefore a correction has to be made.

Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.39.3.387 (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:39:y:1993:i:3:p:387-388

Access Statistics for this article

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