Evripidis Bampis
ABSTRACT
No abstract available.
- J. Aslam, A. Rasala, C. Stein, and N. Young. Improved bicriteria existence theorems for scheduling. In SODA'99 Conference Proceedings, 1999. Google Scholar
Digital Library
- R. Graham, E. Lawler, J. Lenstra, and A. R. Kan. Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Ann. Discrete Math., 5:287--326, 1979.Google ScholarCross Ref
- A. Munier and J.-C. Konig. A heuristic for a scheduling problem with communication delays. Operations Research 45(1):145--148, 1997.Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Bicriteria approximation algorithms for scheduling problems with communications
Recommendations
Bicriteria approximation algorithms for scheduling problems with communications delays
We study the problem of simultaneously minimizing the makespan and the average weighted completion time for the precedence multiprocessor constrained scheduling problem with unit execution times and unit communication delays, known as the UET--UCT ...
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
AbstractWe consider bicriteria flowshop scheduling problems with two machines to simultaneously minimize the makespan and the total completion time without any prioritization between the two objectives. An approximation relative to the optimal value of ...
Comments