Polynomial time algorithms for the unit execution time permutation flowshop problem with time delays

Polynomial time algorithms for the unit execution time permutation flowshop problem with time delays

0.00 Avg rating—0 Votes
Article ID: iaor2009236
Country: United Kingdom
Volume: 35
Issue: 2
Start Page Number: 525
End Page Number: 537
Publication Date: Feb 2008
Journal: Computers and Operations Research
Authors: ,
Keywords: combinatorial analysis
Abstract:

This paper addresses the problem of scheduling a set of n unit execution time 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.

Reviews

Required fields are marked *. Your email address will not be published.