Some scheduling problems with deteriorating jobs and learning effects

Some scheduling problems with deteriorating jobs and learning effects

0.00 Avg rating0 Votes
Article ID: iaor2009967
Country: Netherlands
Volume: 54
Issue: 4
Start Page Number: 972
End Page Number: 982
Publication Date: May 2008
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: deteriorating items, flowshop
Abstract:

Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper, we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. For the single-machine case, we derive polynomial-time optimal solutions for the problems to minimize makespan and total completion time. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. For the case of an m-machine permutation flow shop, we present polynomial-time optimal solutions for some special cases of the problems to minimize makespan and total completion time.

Reviews

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