| Article ID: | iaor19991760 |
| Country: | Netherlands |
| Volume: | 102 |
| Issue: | 3 |
| Start Page Number: | 528 |
| End Page Number: | 537 |
| Publication Date: | Nov 1997 |
| Journal: | European Journal of Operational Research |
| Authors: | Proth Jean-Marie, Sauer Nathalie, Herrmann Jeffrey |
In this paper, we consider the problem of scheduling tasks on unrelated parallel machines. Precedence constraints between the tasks form chains of tasks. We propose a number of heuristics in order to find near optimal solutions to the problem. Empirical results show that the heuristics are able to find very good approximate solutions.