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

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.