Journal
INFORMATION PROCESSING LETTERS
Volume 102, Issue 1, Pages 22-26Publisher
ELSEVIER
DOI: 10.1016/j.ipl.2006.11.002
Keywords
scheduling; single-machine; setup times; learning effect
Categories
Ask authors/readers for more resources
This paper studies a single machine scheduling problem with setup times and learning considerations. The setup times are proportional to the length of the already scheduled jobs. That is, the setup times are past-sequence-dependent. It is assumed that the learning process reflects a decrease in the process time as a function of the number of repetitions, i.e., as a function of the job position in the sequence. The following objectives are considered: the makespan, the total completion time, the total absolute differences in completion times and the sum of earliness, tardiness and common due-date penalty. Polynomial time algorithms are proposed to optimally solve the above objective functions. (c) 2006 Elsevier B.V. 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