Cited By
View all- Li YZeng D(2023)Dependency-Aware Task Scheduling in TrustZone Empowered Edge Clouds for Makespan MinimizationIEEE Transactions on Sustainable Computing10.1109/TSUSC.2023.32786558:3(423-434)Online publication date: 1-Jul-2023
Bicriteria approximation algorithms for scheduling problems with communications
Abstract
No abstract available.
References
[1]
J. Aslam, A. Rasala, C. Stein, and N. Young. Improved bicriteria existence theorems for scheduling. In SODA'99 Conference Proceedings, 1999.
[2]
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.
[3]
A. Munier and J.-C. Konig. A heuristic for a scheduling problem with communication delays. Operations Research 45(1):145--148, 1997.
[4]
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.
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
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2003
374 pages
ISBN:1581136617
DOI:10.1145/777412
- General Chair:
- Arnold Rosenberg,
- Program Chair:
- Friedhelm Meyer auf der Heide
Copyright © 2003 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 June 2003
Check for updates
Qualifiers
- Article
Conference
SPAA03: 15th ACM Symposium on Parallelism in Algorithms and Architecturesn
June 7 - 9, 2003
California, San Diego, USA
Acceptance Rates
SPAA '03 Paper Acceptance Rate 38 of 106 submissions, 36%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 315Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
Cited By
View all- Li YZeng D(2023)Dependency-Aware Task Scheduling in TrustZone Empowered Edge Clouds for Makespan MinimizationIEEE Transactions on Sustainable Computing10.1109/TSUSC.2023.32786558:3(423-434)Online publication date: 1-Jul-2023
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in