Journal
APPLIED MATHEMATICAL MODELLING
Volume 35, Issue 5, Pages 2068-2074Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2010.11.041
Keywords
Group technology; Group availability; Learning effect; Makespan; Total completion time
Ask authors/readers for more resources
This paper considers the problems of scheduling with the effect of learning on a single-machine under group technology assumption. We propose a new learning model where the job actual processing time is linear combinations of the scheduled position of the job and the sum of the normal processing time of jobs already processed. We show that the makespan minimization problem is polynomially solvable. We also prove that the total completion time minimization problem with the group availability assumption remains polynomially solvable under agreeable conditions. (c) 2010 Elsevier Inc. 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