Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags

S. M. Johnson
Additional contact information
S. M. Johnson: The RAND Corporation

Management Science, 1959, vol. 5, issue 3, 299-303

Abstract: This note presents an alternate proof of a result of L. G. Mitten, solving the problem of sequencing n jobs through two machines with arbitrary time lags when the job sequences are the same for both machines. The more difficult general problem is also discussed and partially solved.

Date: 1959
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.5.3.299 (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:5:y:1959:i:3:p:299-303

Access Statistics for this article

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