Permutation vs. non-permutation flow shop schedules

Permutation vs. non-permutation flow shop schedules

0.00 Avg rating—0 Votes
Article ID: iaor1992150
Country: Netherlands
Volume: 10
Issue: 5
Start Page Number: 281
End Page Number: 284
Publication Date: Jul 1991
Journal: Operations Research Letters
Authors: , ,
Abstract:

In studying the m-machine flow shop scheduling problem, it is common practice to focus attention on permutation schedules. The authors show that for the problem of minimizing the maximum completion time, this assumption can be a costly one, by exhibiting a family of instances for which the value of the best permutation schedule is worse than that of the true optimal schedule by a factor of more thanequ1.

Reviews

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