Browse > Article
http://dx.doi.org/10.6109/jkiice.2013.17.8.1934

Online Deadline Scheduling of Equal Length Jobs with More Machines  

Kim, Jae-Hoon (Department of Computer Engineering, Busan University of Foreign Studies)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.17, no.8, 2013 , pp. 1934-1939 More about this Journal
Abstract
In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.
Keywords
Online scheduling; Deadline scheduling; Competitive ratio; Resource augmentation analysis;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. M. Moore, "A n jobs, one machine sequencing algorithm for minimizing the number of late jobs", Management Science, vol. 15, pp. 102-109, Sep. 1968.   DOI   ScienceOn
2 Philippe Baptiste, "An $O(n^{4})$ algorithm for preemptive scheduling of a single machine to minimize the number of late jobs", Operational Research Letters, vol. 24, pp. 175-180, May 1999.   DOI   ScienceOn
3 T. W. Lam and K. K. To, "Performance guarantee for online deadline scheduling in the presence of overload", in Proceeding of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, pp. 755-764, 2001.
4 M. H. Goldwasser, "Patience is a virtue: The effect of slack on competitiveness for admission control", in Proceeding of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, pp. 396-405, 1999.
5 Philippe Baptiste, "Polynomial time algorithms for minimizing the weighted number of jobs on a single machine with equal processing times", Journal of Scheduling, vol. 2, pp. 245-252, Nov. 1999.   DOI
6 R. Lipton and A. Tomkins, "Online interval scheduling", in Proceeding of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, pp. 302-311, 1994.
7 S. Goldman, J. Parwatikar, and S. Suri, "On-line scheduling with hard deadlines", in Proceeding of the 5th International Workshop on Algorithms and Data Structure, Halifax, Canada, pp. 258-271, 1997.
8 C. Phillips, C. Stein, E. Torng, and J. Wein, "Optimal time-critical scheduling via resource augmentation", in Proceeding of the 29th Annual ACM-SIAM Symposium on Theory of Computing, El Paso, Texas, pp. 140-149, 1997.
9 Jae-Hoon Kim and Kyung-Yong Chwa, "Online deadline scheduling with multiple resources", in Proceeding of the 7th Annual Int. Computing and Combinatorics Conference, Guilin, China, pp. 443-452, 2001.