Baptiste, Philippe; Timkovsky, Vadim G. - In: Mathematical Methods of Operations Research 60 (2004) 1, pp. 145-153
Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs. It is known that there exist computable in polynomial time ideal nonpreemptive two-machine schedules of unit-time operation jobs with equal release dates and arbitrary precedence constraints on...
