Showing papers by "Peter Brucker published in 1981"

Minimizing maximum lateness in a two-machine unit-time job shop

Abstract: AnO (nlogn)-algorithm is given for the two-machine, job-shop scheduling problem withn unit-time tasks in which maximum lateness is to be minimized. This algorithm generalizes recent results by Hefetz and Adiri for the corresponding makespan problem.