[Mohri et al., 1999] are interested in a bicriteria scheduling problem where two machines are available to process n independent jobs that can be preempted at any (real) time. Each job J¿ is defined by a processing time p i and a due date di. Without loss of generality we assume that d 1 ≤ d 2 ≤ ... ≤ d n . The aim is to schedule the jobs in such a way that the makespan C max sind the maximum lateness L max are minimised. By considering the e constraint approach they provide a characterisation of strictly non dominated criteria vectors. This problem is solvable in polynomial time.
KeywordsSchedule Problem Completion Time Optimal Schedule Parallel Machine Partial Schedule
Unable to display preview. Download preview PDF.