Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
研究了两机器流水车间中加工时间随等待时间线性变化的调度问题，证明了其NP难性，并提出了一个启发式算法及其最坏情况界。
This paper deals with the problem of finding the minimum finish-time schedule in a two-machine flowshop, 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.