Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 57, Issue 3, Pages 843-846Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.02.014
Keywords
Scheduling; Single machine; Deteriorating jobs; Learning effect
Ask authors/readers for more resources
In this paper, we introduce a new scheduling model in which deteriorating jobs and learning effect are both considered simultaneously. By deterioration and the learning effect, we mean that the actual processing time of a job depends not only on the processing time of the jobs already processed but also on its scheduled position. For the single-machine case, we show that the problems of makespan, total completion time and the sum of the quadratic job completion times remain polynomially solvable, respectively. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain conditions. (C) 2009 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available