| Article ID: | iaor1989510 |
| Country: | United Kingdom |
| Volume: | 40 |
| Issue: | 10 |
| Start Page Number: | 907 |
| End Page Number: | 921 |
| Publication Date: | Oct 1989 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Goyal S.K., Sriskandarajah C. |
| Keywords: | heuristics |
This paper deals with the problem of finding the minimum finish-time schedule in a two-machine flow-shop, where the processing times of jobs are linearly dependent on the job waiting-times. The problem is shown to be NP-hard. A heuristic algorithm is presented, and the worst-case bounds are derived for the different variations of the algorithm.