Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 58, Issue 4, Pages 754-758Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2010.02.006
Keywords
Group scheduling; Deteriorating effect; Learning effect; Makespan; Total completion time
Ask authors/readers for more resources
This paper investigates single-machine group scheduling problems with simultaneous considerations of deteriorating and learning effects to minimize the makespan and the total completion time of all jobs. The group setup time is assumed to follow a simple linear time-dependent deteriorating model. Two models of learning for the job processing time are examined in this study. We provided polynomial time solutions for the makespan minimization problems. We also showed that the total completion time minimization problems remain polynomially solvable under agreeable conditions. (C) 2010 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