Scheduling with multiple performance measures: the one-machine case
Management Science
One-processor scheduling with symmetric earliness and tardiness penalties
Mathematics of Operations Research
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
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
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
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Bicriteria Network Design Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
An experimental study of online scheduling algorithms
Journal of Experimental Algorithmics (JEA)
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Operations Research Letters
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Operations Research Letters
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In this paper, we experimentally evaluate the performances of some natural online algorithms for the bicriteria version of the classical Graham's scheduling problem. In such a setting, jobs are characterized by a processing time and a memory size. Every job must be scheduled on one of the m processors so as to minimize the time makespan and the maximum memory occupation per processor simultaneously. We consider four fundamental classes of algorithms obtained by combining known single-criterion algorithms according to different strategies. The performances of such algorithms have been evaluated according to real world sequences of jobs and to sequences generated by fundamental probability distributions. As a conclusion of our investigation, three particular algorithms have been identified that seem to perform significantly better than the others. One has been presented in Bilo et al. (18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Press, New York) and is the direct bicriteria extension of the basic Graham's greedy algorithm, while the other ones are given by two different combinations of the Graham's algorithm and the Albers' algorithm proposed in Albers (SIAM J. Comput. 29(2) (1999) 459).