Scheduling with multiple performance measures: the one-machine case
Management Science
On the performance of on-line algorithms for partition problems
Acta Cybernetica
A better lower bound for on-line scheduling
Information Processing Letters
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
New algorithms for an ancient scheduling problem
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem
Journal of Algorithms
Scheduling issues in multimedia query optimization
ACM Computing Surveys (CSUR)
Single-machine scheduling to minimize a function of two or three maximum cost criteria
Journal of Algorithms
Minimizing maximum promptness and maximum lateness on a single machine
Mathematics of Operations Research
Online computation and competitive analysis
Online computation and competitive analysis
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Better Bounds for Online Scheduling
SIAM Journal on Computing
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
New lower and upper bounds for on-line scheduling
Operations Research Letters
Operations Research Letters
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Operations Research Letters
Online Balancing Two Independent Criteria
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In this paper, we consider the online bicriteria version of the classical Graham's scheduling problem in which two cost measures must be simultaneously minimized. We present a parametric family of online algorithms F"m={A"k|1=3 they give an r-approximation of the Pareto curve with r=54 for m=4, r=65 for m=5, r=1.186 for m=6 and so forth, with r always less than 1.295. Unfortunately, for m3, obtaining Pareto curves is not trivial, as they would yield optimal algorithms for the single criterion case in correspondence of the extremal tradeoffs. However, the situation seems more promising for the intermediate cases. In fact, we prove that for 5 processors the tradeoff 73,73 of A"3@?F"5 is optimal. Finally, we extend our results to the general d-dimensional case with corresponding applications to the Vector Scheduling problem.