Journal
INFORMATION SCIENCES
Volume 178, Issue 11, Pages 2476-2487Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2008.02.002
Keywords
scheduling; learning effect; single-machine; flowshop
Categories
Ask authors/readers for more resources
In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job's scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. Finally, we present polynomial-time optimal solutions for some special cases of the m-machine flowshop problems to minimize makespan and total completion time. (c) 2008 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