Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663725 | European Journal of Operational Research | 2005 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Claudio Thomás Bornstein, Luciane Ferreira Alcoforado, Nelson Maculan,