Flow shop scheduling problems with decreasing linear deterioration under dominant machines

Flow shop scheduling problems with decreasing linear deterioration under dominant machines

0.00 Avg rating0 Votes
Article ID: iaor20082413
Country: United Kingdom
Volume: 34
Issue: 7
Start Page Number: 2043
End Page Number: 2058
Publication Date: Jul 2007
Journal: Computers and Operations Research
Authors:
Keywords: combinatorial analysis
Abstract:

This paper considers the general, no-wait and no-idle flow shop scheduling problems with deteriorating jobs, respectively. By a deteriorating job, we mean that the processing time is a decreasing function of its execution starting time. The normal processing time proportional to its decreasing rate is assumed and some dominant relationships between machines can be satisfied. It is shown that for the problems to minimize the makespan or the weighted sum of completion time, polynomial algorithms still exist, although these problems are more complicated than the classical ones. When the objective is to minimize the maximum lateness, the solutions of a classical version may not hold.

Reviews

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