Article ID: | iaor20011767 |
Country: | Netherlands |
Volume: | 36 |
Issue: | 2 |
Start Page Number: | 365 |
End Page Number: | 378 |
Publication Date: | Apr 1999 |
Journal: | Computers & Industrial Engineering |
Authors: | Chern Maw-Sheng, Yang Dar-Li |
Keywords: | flowshop |
We consider a two-machine flowshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0–1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computational experiments are also provided.