Journal
INFORMATION SCIENCES
Volume 221, Issue -, Pages 490-500Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2012.09.001
Keywords
Scheduling; Single machine; Flowshop; Learning effect; Makespan; Total completion time
Categories
Funding
- National Science Council of Taiwan, Republic of China [NSC-98-2221-E-150-032]
Ask authors/readers for more resources
Scheduling research has increasingly taken the concept of learning into consideration. In general, a worker's learning effect on a job depends not only on the total processing time of the jobs that he has processed but also on the job's position. Besides, in the early stage of processing a given set of jobs, the worker is not familiar with the operations, so the learning effect on the jobs scheduled early is not apparent. Based on the above observations, we introduce in this paper a position-weighted learning effect model based on sum-of-logarithm-processing-times and job position for scheduling problems. We provide optimal solutions for the single-machine problems to minimize the makespan and the total completion time, and for the single-machine problem to minimize the sum of weighted completion times, the maximum lateness, and the total tardiness under an agreeable situation. We also solve two special cases of the flowshop problem under the learning model. (C) 2012 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