Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482139 | European Journal of Operational Research | 2007 | 12 Pages |
Abstract
This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on randomly generated test problems and results show that the algorithm solves problems with moderate sizes in a reasonable amount of computation time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Sang-Oh Shim, Yeong-Dae Kim,