A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
An O(n2) algorithm is presented for the n jobs m parallel machines problem with identical processing times. Due dates for each job are given and the objective is the minimization of the number of late jobs. Preemption is permitted. The problem can be formulated as a maximum flow network model. The optimality proof as well as other properties and a complete example are given.
parallel machines scheduling problem preemptive scheduling combinatorial optimization