Title of article
Polynomial time algorithms for the UET permutation flowshop problem with time delays
Author/Authors
Alix Munier-Kordon، نويسنده , , Djamal Rebaine، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2008
Pages
13
From page
525
To page
537
Abstract
This paper addresses the problem of scheduling a set of n unit execution time (UET) jobs on an m-permutation flowshop with arbitrary time delays, so as to minimize the makespan criterion. A polynomial time algorithm is exhibited for the three-machine and four-machine cases, respectively
Keywords
Complexity , Makespan , Scheduling , Time delays , Permutation flowshop
Journal title
Computers and Operations Research
Serial Year
2008
Journal title
Computers and Operations Research
Record number
928601
Link To Document