Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 58, Issue 1, Pages 58-63Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.08.003
Keywords
Scheduling; Single machine; Learning effect; Deteriorating jobs
Funding
- Science Research Foundation of the Educational Department of Liaoning Province, China [20060662]
Ask authors/readers for more resources
In this paper we consider the single machine scheduling problems with time-dependent deterioration and exponential learning effect, i.e., 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. We consider the following objective functions: the makespan, the sum of the delta th (delta >= 0) power of job completion times, the total weighted completion time and the maximum lateness. We show that the makespan minimization problem, the sum of the delta th power of job completion times minimization problem can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions. (C) 2009 Published by Elsevier Ltd.
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