Scheduling Algorithms
Single-machine group scheduling with a time-dependent learning effect
Computers and Operations Research
Single machine scheduling with past-sequence-dependent setup times and learning effects
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
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
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Minimizing the makespan on a single machine with learning and unequal release times
Computers and Industrial Engineering
Some single-machine scheduling problems with a truncation learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
Two-machine flowshop scheduling with truncated learning to minimize the total completion time
Computers and Industrial Engineering
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
Computers and Operations Research
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Scheduling on parallel identical machines with job-rejection and position-dependent processing times
Information Processing Letters
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
Information Sciences: an International Journal
Computers and Industrial Engineering
Journal of Combinatorial Optimization
| Hi-index | 0.89 |
We consider a scheduling problem with job-dependent learning effects and multiple rate-modifying activities. The learning effects manifest such that the processing time of a job is a decreasing function of its position in a sequence. By job-dependent learning effects, we mean that the learning of the jobs is different. A rate-modifying activity is an activity that changes the production rate of a machine. So the actual processing time of a job in our problem is a variable, which depends not only on its position in a sequence but also on whether it is scheduled before or after a rate-modifying activity. We assume that each machine may have multiple rate-modifying activities. The objective is to minimize the total completion time. We show that all the cases of the problem are polynomially solvable.