Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
- Additional Document Info
- View All
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. © 1989 Operational Research Society Ltd.
author list (cited authors)
Sriskandarajah, C., & Goyal, S. K.
complete list of authors
Sriskandarajah, C||Goyal, SK