Sequencing n Jobs on Two Machines with Arbitrary Time Lags

L. G. Mitten
Additional contact information
L. G. Mitten: Northwestern University

Management Science, 1959, vol. 5, issue 3, 293-298

Abstract: Each of n jobs must be run first on machine I and then on machine I. Running times for each job on each machine are given. Also specified are arbitrary time lags which prescribe that a job may not be started (completed) on machine II until at least a certain time has elapsed since starting (completing) the job on machine I. A rule is given for determining the sequence in which jobs are to be run on the machines--using the same sequence for both machines--in order to minimize the time between the start of production of the first job on machine I and the completion of production of the last job on machine II.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.5.3.293 (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:293-298

Access Statistics for this article

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