A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

✍ Scribed by Dar-Li Yang; Maw-Sheng Chern

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 192 KB
• Volume: 36
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/s0360-8352(99)00137-0

✦ Synopsis

We consider a two-machine ¯owshop 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.