Solvable cases of permutation flowshop scheduling with dominating machines

Solvable cases of permutation flowshop scheduling with dominating machines

0.00 Avg rating0 Votes
Article ID: iaor20011304
Country: Netherlands
Volume: 66
Issue: 1
Start Page Number: 53
End Page Number: 57
Publication Date: Jan 2000
Journal: International Journal of Production Economics
Authors: , ,
Keywords: flowshop
Abstract:

In this paper we study the permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polymonial-time solution algorithm for each case.

Reviews

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