Delayed information and action in on-line algorithms
Information and Computation
On randomized online scheduling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Barely random algorithms for multiprocessor scheduling
Journal of Scheduling - Special issue: On-line scheduling
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
Journal of Scheduling
Experimental analysis of online algorithms for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Scheduling Web Advertisements: A Note on the Minspace Problem
Journal of Scheduling
Online scheduling of splittable tasks
ACM Transactions on Algorithms (TALG)
Pareto approximations for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
Load balancing of temporary tasks in the lp norm
Theoretical Computer Science - Approximation and online algorithms
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics - Special issue: Max-algebra
Utilization of nonclairvoyant online schedules
Theoretical Computer Science
Scheduling resource allocation with timeslot penalty for changeover
Theoretical Computer Science
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Semi on-line scheduling on three processors with known sum of the tasks
Journal of Scheduling
List's worst-average-case or WAC ratio
Journal of Scheduling
Online Scheduling with Bounded Migration
Mathematics of Operations Research
A Mathematical Programming Approach for Online Hierarchical Scheduling
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics
Minimizing the maximum starting time on-line
Information and Computation
Experimental analysis of online algorithms for the bicriteria scheduling problem
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
On-line hierarchical job scheduling on grids with admissible allocation
Journal of Scheduling
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Online rescheduling of multiple picking agents for warehouse management
Robotics and Computer-Integrated Manufacturing
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Online hierarchical scheduling: An approach using mathematical programming
Theoretical Computer Science
Online scheduling with rearrangement on two related machines
Theoretical Computer Science
Online scheduling with rejection and withdrawal
Theoretical Computer Science
Semi-online scheduling revisited
Theoretical Computer Science
Online minimum makespan scheduling with a buffer
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Scheduling of variable-time jobs for distributed systems with heterogeneous processor cardinality
International Journal of Ad Hoc and Ubiquitous Computing
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Semi-online scheduling problems on a small number of machines
Journal of Scheduling
| Hi-index | 0.01 |
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goal is to minimize the makespan. Bartal et al. [ J. Comput. System Sci., 51 (1995), pp. 359--366] gave a deterministic online algorithm that is 1.986-competitive. Karger, Phillips, and Torng [ J. Algorithms, 20 (1996), pp. 400--430] generalized the algorithm and proved an upper bound of 1.945. The best lower bound currently known on the competitive ratio that can be achieved by deterministic online algorithms is equal to 1.837. In this paper we present an improved deterministic online scheduling algorithm that is 1.923-competitive; for all $m\geq 2$. The algorithm is based on a new scheduling strategy, i.e., it is not a generalization of the approach by Bartal et al. Also, the algorithm has a simple structure. Furthermore, we develop a better lower bound. We prove that, for general m, no deterministic online scheduling algorithm can be better than 1.852-competitive.