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
Some scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Single-machine scheduling with general learning functions
Computers & Mathematics with Applications
Computers and Industrial Engineering
Computers & Mathematics with Applications
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 and flowshop scheduling with a general learning effect model
Computers and Industrial Engineering
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Information Sciences: an International Journal
Single-machine scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Scheduling problems with deteriorating jobs and learning effects including proportional setup times
Computers and Industrial Engineering
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Information Processing Letters
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect
Computers and Industrial Engineering
Minimizing the makespan on a single machine with learning and unequal release times
Computers and Industrial Engineering
Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect
Computers & Mathematics with Applications
Computers and Industrial Engineering
Machine scheduling problems with a general learning effect
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Computers and Industrial Engineering
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Several flow shop scheduling problems with truncated position-based learning effect
Computers and Operations Research
Hi-index | 0.01 |
Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called ''sum-of processing-times-based learning'' in which the actual processing time of a job is a non-increasing function of the jobs already processed. However, the actual processing time of a given job drops to zero precipitously when the normal job processing times are large. Motivated by this observation, we propose a truncation learning model where the actual job processing time is a function which depends not only on the processing times of the jobs already processed but also on a control parameter. The use of the truncated function is to model the phenomenon that the learning of a human activity is limited. Under the proposed learning model, we show that some single-machine scheduling problems can be solved in polynomial time. In addition, we further provide the worst-case error bounds for the problems to minimize the maximum lateness and total weighted completion time.