Title of article
A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time
Author/Authors
Dar-Li Yang، نويسنده , , Maw-Sheng Chern، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 1999
Pages
14
From page
365
To page
378
Abstract
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.
Keywords
Flowshop , Scheduling , Waiting time , 0–1 Mixed integer program , NP-hard
Journal title
Computers & Industrial Engineering
Serial Year
1999
Journal title
Computers & Industrial Engineering
Record number
926130
Link To Document