Abstract
We consider semi on-line scheduling on two uniform machines. The speed of the slow machine is normalized to 1 while the speed of the fast machine is assumed to be s≥1. Jobs of size J 1,J 2,… arrive one at a time, and each J i (i≥1) has to be assigned to one of the machines before J i+1 arrives. The assignment cannot be changed later. The processing time of the ith job is J i on the slow machine and J i /s on the fast one. The objective is to minimize the makespan. We study both the case where the only information known in advance is the total size ∑i≥1 J i of the jobs and the case where the only information known in advance is the optimum makespan. For each of these two cases, we almost completely determine the best possible competitive ratio of semi on-line algorithms compared to the off-line optimum, as a function of s in the range \(1\le s<\frac{1+\sqrt{17}}{4}\approx1.2808\) , except for a very short subinterval around s=1.08. We also prove that the best competitive ratio achievable for known optimum is at least as good as the one for known sum, even for any number of uniform machines of any speeds.
Similar content being viewed by others
References
Angelelli E (2000) Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks. Cent Eur J Oper Res 8:285–295
Angelelli E, Speranza MG, Szoldatics J, Tuza Zs (2009) Geometric representation for semi on-line scheduling on uniform processors. Optim Methods Softw, in print
Angelelli E, Speranza MG, Tuza Zs (2003) Semi on-line scheduling on two parallel processors with upper bound on the items. Algorithmica 37:243–262
Angelelli E, Speranza MG, Tuza Zs (2006) New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Math Theor Comp Sci 8:1–6
Angelelli E, Speranza MG, Tuza Zs (2008) Semi-online scheduling on two uniform processors. Theor Comp Sci 393:211–219
Azar Y, Regev O (2001) On-line bin-stretching. Theor Comp Sci 168:17–41
Cho Y, Sahni S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9:91–103
Dósa Gy, He Y (2004) Semi on-line algorithms for parallel machine scheduling problems. Computing 72:355–363
Dósa Gy, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing 76:149–164
Epstein L (2003) Bin stretching revisited. Acta Inform 39:97–117
Epstein L, Noga J, Seiden S, Sgall J, Woeginger G (2001) Randomized on-line scheduling on two uniform machines. J Sched 4:71–92
Epstein L, Favrholdt LM (2002) Optimal non-preemptive semi-online scheduling on two related machines. In: Proceedings of the 27th MFCS, pp 245–256
Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Techn J 45:1563–1581
He Y, Zhang G (1999) Semi on-line scheduling on two identical machines. Computing 62:179–187
Kellerer H, Kotov V, Speranza MG, Tuza Zs (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235–242
Ng CT, Tan Z, He Y, Cheng TCE (2009) Two uniform semi-online scheduling problems on two uniform machines. Theor Comp Sci. 410:776–792. doi:10.1016/j.tcs.2008.11.018
Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton, pp 15-1–15-41 (Chapter 15)
Author information
Authors and Affiliations
Corresponding author
Additional information
Z. Tuza was supported in part by the Hungarian Scientific Research Fund, grant OTKA T-049613.
Rights and permissions
About this article
Cite this article
Dósa, G., Speranza, M.G. & Tuza, Z. Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. J Comb Optim 21, 458–480 (2011). https://doi.org/10.1007/s10878-009-9265-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9265-2