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
An energy-efficient real-time scheduling scheme on dual-channel networks
Information Sciences: an International Journal
Information Sciences: an International Journal
Measuring individual learning performance in group work from a knowledge integration perspective
Information Sciences: an International Journal
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Recognizing yield patterns through hybrid applications of machine learning techniques
Information Sciences: an International Journal
A multi-modal immune algorithm for the job-shop scheduling problem
Information Sciences: an International Journal
Solution algorithms for the makespan minimization problem with the general learning model
Computers and Industrial Engineering
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Some single-machine and m-machine flowshop scheduling problems with learning considerations
Information Sciences: an International Journal
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Information Processing Letters
Minimizing the makespan on a single machine with learning and unequal release times
Computers and Industrial Engineering
Scheduling problems with general effects of deterioration and learning
Information Sciences: an International Journal
Some single-machine scheduling problems with a truncation learning effect
Computers and Industrial Engineering
Information Sciences: an International Journal
Computers and Industrial Engineering
Information Sciences: an International Journal
Information Sciences: an International Journal
The single-machine total weighted tardiness scheduling problem with position-based learning effects
Computers and Operations Research
Scheduling with general position-based learning curves
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Computers and Industrial Engineering
Machine scheduling problems with a general learning effect
Mathematical and Computer Modelling: An International Journal
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
Information Sciences: an International Journal
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
Computers and Operations Research
Information Sciences: an International Journal
Single machine scheduling with autonomous learning and induced learning
Computers and Industrial Engineering
Hi-index | 0.07 |
Scheduling with learning effects has attracted growing attention of the scheduling research community. A recent survey classifies the learning models in scheduling into two types, namely position-based learning and sum-of-processing-times-based learning. However, the actual processing time of a given job drops to zero precipitously as the number of jobs increases in the first model and when the normal job processing times are large in the second model. Motivated by this observation, we propose a new learning model where the actual job processing time is a function of the sum of the logarithm of the processing times of the jobs already processed. The use of the logarithm function is to model the phenomenon that learning as a human activity is subject to the law of diminishing return. Under the proposed learning model, we show that the scheduling problems to minimize the makespan and total completion time can be solved in polynomial time. We further show that the problems to minimize the maximum lateness, maximum tardiness, weighted sum of completion times and total tardiness have polynomial-time solutions under some agreeable conditions on the problem parameters.