Minimizing total weighted completion time in a proportionate flow shop

Minimizing total weighted completion time in a proportionate flow shop

0.00 Avg rating0 Votes
Article ID: iaor2000829
Country: United Kingdom
Volume: 1
Issue: 3
Start Page Number: 157
End Page Number: 168
Publication Date: Oct 1998
Journal: Journal of Scheduling
Authors: , ,
Keywords: flowshop
Abstract:

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time.

Reviews

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