Sequencing n Jobs on Two Machines with Arbitrary Time Lags: Alternate Proof and Discussion of General Case

Sequencing n Jobs on Two Machines with Arbitrary Time Lags: Alternate Proof and Discussion of General Case

$15.00 $15.00 Sale

An alternate proof of a result of L. G. Mitten in solving the problem of sequencing n jobs through two machines with arbitrary time lags, assuming similarity of the job sequences for both machines.