Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time Academic Article

abstract

• 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.

authors

• Sriskandarajah, Chelliah

published proceedings

• Journal of the Operational Research Society

author list (cited authors)

• Sriskandarajah, C., & Goyal, S. K.

citation count

• 18

complete list of authors

• Sriskandarajah, C||Goyal, SK

publication date

• October 1989

publisher

• Taylor & Francis  Publisher

published in

• JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY  Journal

Digital Object Identifier (DOI)

• 10.1057/jors.1989.159

start page

• 907

end page

• 921

volume

• 40

issue

• 10

URL

• http://dx.doi.org/10.1057/jors.1989.159