| Article ID: | iaor20011300 |
| Country: | Netherlands |
| Volume: | 125 |
| Issue: | 2 |
| Start Page Number: | 370 |
| End Page Number: | 380 |
| Publication Date: | Sep 2000 |
| Journal: | European Journal of Operational Research |
| Authors: | Gupta Jatinder N.D., Ruiz-Torres Alex J. |
| Keywords: | heuristics |
This paper considers the identical parallel-machine scheduling problem of minimizing makespan subject to minimum total flow-time. In view of the NP-hard nature of the problem, lower bounds on the optimal makespan value and efficient heuristic algorithms for finding optimal schedules are described and empirically evaluated as to their effectiveness in finding optimal schedules.