A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
Information Processing Letters
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Approximation and Online Algorithms
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Online maximizing weighted throughput in a fading channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Improved online scheduling in maximizing throughput of equal length jobs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Temperature aware online algorithms for scheduling equal length jobs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
A comprehensive study of an online packet scheduling algorithm
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
Competitive strategies for on-line production order disposal problem
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Online scheduling of bounded length jobs to maximize throughput
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A comprehensive study of an online packet scheduling algorithm
Theoretical Computer Science
Temperature aware online algorithms for scheduling equal length jobs
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor nonpreemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competitive ratios below $2$ and show several lower bounds on the competitive ratios. First, we give a barely random $5/3$-competitive algorithm that uses only one random bit. We also show a lower bound of $3/2$ on the competitive ratio of barely random algorithms that randomly choose one of two deterministic algorithms. If the two algorithms are selected with equal probability, we can further improve the bound to $8/5$. Second, we give a deterministic $3/2$-competitive algorithm in the model that allows restarts, and we show that in this model the ratio $3/2$ is optimal. For randomized algorithms with restarts we show a lower bound of $6/5$.