| Article ID: | iaor1990556 |
| Country: | United States |
| Volume: | 36 |
| Issue: | 4 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Apr 1990 |
| Journal: | Management Science |
| Authors: | So Kut C. . |
This paper studies the problem of scheduling jobs on parallel machines with setup times. When a machine switches from processing one type of job to another type, setup times are incurred. The problem is to find a feasible schedule for each machine which maximizes the total reward. The paper studies three heuristics for solving this problem. Analytical and empirical results of the heuristics are given.