Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
Dynamic scheduling on parallel machines
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Makespan minimization in job shops: a polynomial time approximation scheme
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science
Scheduling Algorithms
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
Mathematics of Operations Research
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
SIAM Journal on Computing
Better Approximation Guarantees for Job-Shop Scheduling
SIAM Journal on Discrete Mathematics
Approximation Algorithms for Flexible Job Shop Problems
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
Embedded simulation on a multiprocessor job scheduling system with inspection
Computers and Industrial Engineering
| Hi-index | 0.00 |
We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most µ ordered operations that can be processed on different (possibly all) subsets of m machines with different processing times, compute a schedule (preemptive or non-preemptive, depending on the model) with minimum makespan where operations belonging to the same task have to be scheduled according to the specified order. We propose algorithms for both preemptive and non-preemptive variants of this problem that compute approximate solutions of any positive ε accuracy and run in O(n) time for any fixed values of m, µ, and ε. These results include (as special cases) many recent developments on polynomial time approximation schemes for scheduling jobs on unrelated machines, multiprocessor tasks, and classical open, flow and job shops.