A note on bicriteria schedules with optimal approximations ratios

Parallel Processing Letters

Volumn 14, Issue 2, 2004, Pages 315-323

  Baille, Fabien ^a   Bampis, Evripidis ^a   Laforest, Christian ^a  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Bicriteria approximation; Scheduling

Indexed keywords

BICRITERIA APPROXIMATION; PARALLEL IDENTICAL MACHINES;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; COMPUTER SOFTWARE; PROBLEM SOLVING; WORLD WIDE WEB;

PARALLEL PROCESSING SYSTEMS;

EID: 4344579411     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626404001891     Document Type: Article

References (12)

1. E. Angel, E. Bampis, and A. Kononov. A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In European Symposium on Algorithms (ESA), pages 194-205. Springer, 2001.
2. E. Angel, E. Bampis, and A. Kononov. On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci., 306(1-3):319-338, 2003.
3. E. Arkin and B. Silverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18:1-8, 1987.
4. J. Aslam, A. Rasala, C. Stein, and N. Young. Improved bicriteria existence theorems for scheduling. In Proc. SODA '1999, 1999.
5. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of multiple machines under real-time scheduling. In STOCS 99, pages 622-631, 1999.
6. M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Applied Mathemetics, 59:225-235, 1995.
7. M. Ehrgott. Multicriteria optimization, volume 491 of Lecture Notes in Economics and Mathematical Systems. Springer, 2000.
8. U. Faigle and M. Nawijn. Note on scheduling intervals on-line. Discrete Applied Mathematics, 58:13-17, 1995.
9. U. Faigle and W.M. Nawijn. Greedy k-decomposition of intervals order. In Proceedings 2nd Twente Workshop on Graphs and Combinatorial Optimisation, pages 53-56. Department of Applied Mathematics, University of Twente, 1991.
10. Ch. Papadimitriou and M. Yannakakis. On the approximability of trade-off and optimal access of web sources. In FOCS, pages 86-92, 2000.
11. A. Rasala, C. Stein, E. Torng, and P. Uthaisombut. Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. In Proc. SODA, 2002.
12. C. Stein and J. Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21, 1997.