Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- 1 April 1959
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 5 (3) , 299-303
- https://doi.org/10.1287/mnsc.5.3.299
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.Keywords
This publication has 0 references indexed in Scilit: