A note on scheduling on a single processor with speed dependent on a number of executed jobs
Information Processing Letters
A learning curve primer for software engineers
ACM SIGSOFT Software Engineering Notes
MPI: The Complete Reference
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Information Sciences: an International Journal
Some scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Time-Dependent Scheduling
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Computers and Operations Research
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Single-machine and flowshop scheduling with a general learning effect model
Computers and Industrial Engineering
Some single-machine and m-machine flowshop scheduling problems with learning considerations
Information Sciences: an International Journal
Machine scheduling problems with a general learning effect
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Single-machine group scheduling with resource allocation and learning effect
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
Computers and Industrial Engineering
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
Information Sciences: an International Journal
| Hi-index | 0.00 |
We consider a parallel-machine scheduling problem with a learning effect and the makespan objective. The impact of the learning effect on job processing times is modelled by the general DeJong's learning curve. For this NP-hard problem we propose two exact algorithms: a sequential branch-and-bound algorithm and a parallel branch-and-bound algorithm. We also present the results of experimental evaluation of these algorithms on a computational cluster. Finally, we use the exact algorithms to estimate the performance of two greedy heuristic scheduling algorithms for the problem.