Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities
Information Processing Letters
A note on “parallel machine scheduling with non-simultaneous machine available time”
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A 3/4-Approximation Algorithm for Multiple Subset Sum
Journal of Heuristics
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
An efficient fully polynomial approximation scheme for the Subset-Sum problem
Journal of Computer and System Sciences
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
The effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Makespan Minimization with Machine Availability Constraints
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Faster approximation algorithms for scheduling with fixed jobs
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Faster approximation algorithms for scheduling with fixed jobs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Hi-index | 0.00 |
We study the problem of scheduling n independent jobs on a system of m identical parallel machines in the presence of reservations. This constraint is practically important; for various reasons, some machines are not available during specified time intervals. The objective is to minimize the makespan. This problem is inapproximable in the general case unless P = NP which motivates the study of suitable restrictions. We use an approach based on algorithms for multiple subset sum problems; our technique yields a polynomial time approximation scheme (PTAS) which is best possible in the sense that the problem does not admit an FPTAS unless P = NP. The PTAS presented here is the first one for the problem under consideration; so far, not even for special cases approximation schemes have been proposed. We also derive a low cost algorithm with a constant approximation ratio and discuss additional FPTASes for special cases and complexity results.