The clustered flow-shop problem

The clustered flow-shop problem

0.00 Avg rating0 Votes
Article ID: iaor198896
Country: Germany
Volume: 32
Start Page Number: 315
End Page Number: 322
Publication Date: Dec 1988
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors:
Abstract:

This paper considers a generalization of the classical flow shop problem where n the items, grouped into k fixed sequences (clusters) are processed on m machines. A permutation is being sought that minimizes the completion time of processing all items. This paper develops conditions when the clustered problem can be reduced to a classical case. It also provides sufficient optimality conditions for an approximate solution generated by a method for the two machine clustered problem.

Reviews

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