Abstract
We consider the problem of online scheduling on 2 uniform machines where one machine is periodically unavailable. The problem is online in the sense that when a job presents, we have to assign it to one of the 2 uniform machines before the next one is seen. Preemption is not allowed. The objective is to minimize makespan. Assume that the speed of the periodically unavailable machine is normalized to 1, while the speed of the other one is s. Given a constant number α> 0, we also suppose that T u = αT a , where T u and T a are the length of each unavailable time period and the length of the time interval between two consecutive unavailable time periods, respectively. In the case where s ≥ 1, we show a lower bound of the competitive ratio \(1+\frac{1}{s}\) and prove that LS algorithm is optimal. We also show that for the problem P2, M1PU|online, T u = αT a |C max , LS algorithm proposed in [7] is optimal with a competitive ratio 2. After that, we give some lower bounds of competitive ratio in the case 0 < s < 1. At last, we study a special case P2, M1PU|online,T u = αT a , non − increasing sequence|C max , where non-increasing sequence means that jobs arrive in a non-increasing order of their processing times. We show that LS algorithm is optimal with a competitive ratio \(\frac{3}{2}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)
Lee, C.Y., Lei, L., Piendo, M.: Current trends in deterministic scheduling. Ann. Oper. Res. 70, 1–41 (1997)
Liao, C.J., Shyur, D.L., Lin, C.H.: Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research 160, 445–456 (2005)
Lee, C.Y.: Machine scheduling with an availability constraint. Jounral of Global Optimization 9, 395–416 (1996)
Tan, Z., He, Y.: Optimal online algorithm for scheduling on two identical machines with machine availability constraints. Information Processing Letters 83, 323–329 (2002)
Xu, D., Cheng, Z., Yin, Y., Li, H.: Makespan minimization for two parallel machines scheduling with a periodic availability constraint. Computers and Operations Research (2008), doi:10.1016/j.cor.2008.05.001
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
Liu, M., Chu, C., Xu, Y., Wang, L. (2010). Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)