Track:
All Papers
Downloads:
Abstract:
This paper addresses the complexity of scheduling problems considering two jobs to schedule and availability constraints imposed on the machines. A polynomial algorithm called temporized geometric approach is first proposed for the minimization of the makespan, under the non-preemption constraint. Then, a generalization to the preemptive case is developed. These algorithms are extensions of the geometric approach, which allows solving the classical twojob scheduling problem.