Efficient algorithms for scheduling semiconductor burn-in operations
Operations Research
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
SIAM Journal on Optimization
Scheduling Multiple Variable-Speed Machines
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Finding the Pareto-optima for the total and maximum tardiness single machine problem
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Operations Research Letters
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Near Admissible Algorithms for Multiobjective Search
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Anytime algorithms for biobjective heuristic search
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
| Hi-index | 5.23 |
We consider multiobjective scheduling problems, i.e. scheduling problems that are evaluated with respect to many cost criteria, and we are interested in determining a trade-off (Pareto curve) among these criteria. We study two types of bicriteria scheduling problems: single-machine batching problems and parallel machine scheduling problems. Instead of proceeding in a problem-by-problem basis, we identify a class of multiobjective optimization problems possessing a fully polynomial time approximation scheme (FPTAS) for computing an ε-approximate Pareto curve. This class contains a set of problems whose Pareto curve can be computed via a simple pseudo-polynomial dynamic program for which the objective and transition functions satisfy some, easy to verify, arithmetical conditions. Our study is based on a recent work of Woeginger (Electronic Colloquium on Computational Complexity, Report 84 (short version appeared in SODA'99, pp. 820-829)) for the single criteria optimization ex-benevolent problems. We show how our general result can be applied to the considered scheduling problems.