Algorithms in C
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
UET-scheduling with constrained processor allocations
Computers and Operations Research
Analysis of scheduling problems with typed task systems
Discrete Applied Mathematics
Lower bounds for the job-shop scheduling problem on multi-purpose machines
Proceedings of the workshop on Discrete algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fast approximation algorithms for job scheduling with processing set restrictions
Theoretical Computer Science
| Hi-index | 0.01 |
This article explores the impact of restricting the machines upon which individual jobs may be scheduled. Even the simple case of a single stage of identical parallel machines cannot be solved to optimality in a reasonable time. We therefore focus on the case when job processing times are identical. In some applications the machine processing sets of jobs are structured in a nested fashion and do not partially overlap. We present efficient algorithms for solving this nested problem to optimality for each of the standard scheduling objective functions. In particular, an algorithm with constant running time minimises makespan on a fixed number of machines regardless of the number of jobs. Improvements in efficiency have been gained by attention to implementation issues, thus challenging the conventional approach to evaluating complexity.