Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position

Authors:
T. C. E. Cheng;Wen-Hung Kuo;Dar-Li Yang
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan, ROC;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2013

Citing 15
Cited 1

A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
The learning effect: Getting to the core of the problem

Information Processing Letters
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
A new approach to the learning effect: Beyond the learning curve restrictions

Computers and Operations Research
Job Sequencing with Exponential Functions of Processing Times

Informatica
Some scheduling problems with general position-dependent and time-dependent learning effects

Information Sciences: an International Journal
Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

Information Sciences: an International Journal
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
Scheduling with general position-based learning curves

Information Sciences: an International Journal
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Information Sciences: an International Journal
Erratum: A revision of some single-machine and m-machine flowshop scheduling problems with learning considerations

Information Sciences: an International Journal
The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

Information Sciences: an International Journal

Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

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.