Adams, Joseph; Balas, Egon; Zawack, Daniel - In: Management Science 34 (1988) 3, pp. 391-401
We describe an approximation method for solving the minimum makespan problem of job shop scheduling. It sequences the machines one by one, successively, taking each time the machine identified as a bottleneck among the machines not yet sequenced. Every time after a new machine is sequenced, all...