Abstract
We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total value of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and possibly allocated a fixed scheduling interval as well; if these accepted jobs are eventually not completed they incur a penalty (on top of not getting the value of the job). We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4, 125–144 (1992)
Ding, J., Ebenlendr, T., Sgall, J., Zhang, G.: Online scheduling of equal-length jobs on parallel machines. In: Proc. of 15th ESA, pp. 427–438 (2007)
Ding, J., Zhang, G.: Online scheduling with hard deadlines on parallel machines. In: Proc. of 2nd AAIM, pp. 32–42 (2006)
Ebenlendr, T., Sgall, J.: A lower bound for scheduling of unit jobs with immediate decision on parallel machines. In: Proc. of 6th WAOA, pp. 43–52 (2008)
Fung, S.P.Y.: Lower bounds on online deadline scheduling with preemption penalties. Information Processing Letters 108(4), 214–218 (2008)
Goldwasser, M.H., Kerbikov, B.: Admission control with immediate notification. J. of Scheduling 6, 269–285 (2003)
Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters 27(5), 193–197 (2000)
Koren, G., Shasha, D.: D over: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. on Computing 24, 318–339 (1995)
Thibault, N., Laforest, C.: Online time constrained scheduling with penalties. In: Proc. of 23rd IEEE Int. Symposium on Parallel and Distributed Processing (2009)
Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130(1), 5–16 (1994)
Zheng, F., Dai, W., Xiao, P., Zhao, Y.: Competitive strategies for on-line production order disposal problem. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol. 3521, pp. 46–54. Springer, Heidelberg (2005)
Zheng, F., Fung, S.P.Y., Chan, W.-T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 320–329. Springer, Heidelberg (2006)
Zheng, F., Xu, Y., Poon, C.K.: On job scheduling with preemption penalties. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 315–325. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fung, S.P.Y. (2010). Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-14031-0_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14030-3
Online ISBN: 978-3-642-14031-0
eBook Packages: Computer ScienceComputer Science (R0)