Permutation schedules for flow shops with precedence constraints

Permutation schedules for flow shops with precedence constraints

0.00 Avg rating—0 Votes
Article ID: iaor1992135
Country: United States
Volume: 38
Issue: 6
Start Page Number: 1135
End Page Number: 1139
Publication Date: Nov 1990
Journal: Operations Research
Authors: , ,
Abstract:

The authors show that permutation schedules are always optimal for regular, symmetric measures of performance for the m-machine flow shop with precedence constraints provided that processing times are identical for noncomparable jobs.

Reviews

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