Bicriteria approximation algorithms for scheduling problems with communications delays

Journal of Scheduling

Volumn 8, Issue 4, 2005, Pages 281-294

  Bampis, Evripidis ^a   Kononov, Alexander ^a  

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

Author keywords

Approximability; Communications delays; Multicriteria optimization; Scheduling

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

APPROXIMABILITY; COMMUNICATION DELAYS; MULTICRITERIA OPTIMIZATION; SCHEDULING PROBLEMS;

ALGORITHMS;

EID: 21144441140     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-005-1637-6     Document Type: Conference Paper

References (16)

1. Angel, E., E. Bampis, and A. Kononov, "A FPTAS for approximating the unrelated parallel machines scheduling problem with costs," in Proceedings of ESA'2001, 2001, pp. 194-205.
2. Aslam, J., A. Rasala, C. Stein, and N. Young, "Improved bicriteria existence theorems for scheduling," in Proceedings of ACM-SODA' 1999, pp 846-847.
3. Chen, B., C. N. Potts, and G. J. Woeginger, "A review of machine scheduling: Complexity, algorithms and approximability," Technical Report Woe-29, TU Graz, 1998.
4. Ergott, M., Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 491, 2000.
5. Erlebach, H., H. Kellerer, and U. Pferschy, "Approximating multi-objective Knapsack problems," in Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001) LNCS 2125, Springer Verlag, 2001, pp. 210-221.
6. Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling theory: A survey," Annals of Discrete Mathematics, 5, 287-326 (1979).
7. Hanen, C. and D. S. A. Munier, "An approximation algorithm for scheduling dependent tasks on m processors with small communication delays," in IEEE Symposium on Emerging Technologies and Factory Automation, September 1995.
8. Hoogeveen, J. A., J. K. Lenstra, and B. Veltman, "Three, four, five, six, or the complexity of scheduling with communication delays," Operations Research Letters, 16(3), 129-137 (1994).
9. Möhring, R. H., M. W. Schäfter, and A. S. Schulz, "Scheduling jobs with communication delays - Using infeasible solutions for approximation," in Proceedings of the Fourth European Symposium on Algorithms, Lecture Notes in Computer Science, 1136, Springer Verlag, 1996, pp. 76-90.
10. Munier, A. and J. C. König, "A heuristic for a scheduling problem with communication delays," Operations Research, 45(1), 145-148 (1997).
11. Papadimitriou, C. H. and M. Yannakakis, "On the approximability of trade-offs and optimal access of web sources," in Proceedings of FOCS'2000, 2000, pp. 86-92.
12. Rasala, A., "Existence theorems for scheduling to meet two objectives," Department of Computer Science, Dartmouth College, Technical Report PCS-TR 99-347, 1999.
13. Rasala, A., C. Stein, E. Tomg, and P. Uthaisom, "Existence theorems, lower bounds and algorithms for scheduling to meet two objectives," in Proceedings of ACM-SODA, 2002, pp 723-731.
14. Schulz, A. S., "Polytopes and scheduling," PhD thesis, Technical University of Berlin, Berlin, Germany, 1995.
15. Schulz, A. S., "Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds," in LNCS 1084, Proceedings of the 5th International IPCO Conference, 1996, pp. 301-315.
16. Stein, C. and J. Wein, "On the existence of schedules that are near-optimal for both makespan and total weighted completion time," Operations Research Letters, 21(3), 115-122 (1997).