Semi on-line scheduling on three processors with known sum of the tasks | Journal of Scheduling Skip to main content
Log in

Semi on-line scheduling on three processors with known sum of the tasks

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider a semi on-line version of the multiprocessor scheduling problem on three processors, where the total size of the tasks is known in advance. We prove a lower bound \(1+\frac{\sqrt{129}-9}{6}>1.3929\) on the competitive ratio of any algorithm and propose a simple algorithm with competitive ratio equal to 1.5. The performance is improved to \(1+\frac{8}{19}<1.4211\) by a preprocessing strategy. The latter algorithm is only 2% away from the lower bound.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29, 459–473.

    Article  Google Scholar 

  • Angelelli, E. (2000). Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks. Central European Journal of Operations Research, 8, 285–295.

    Google Scholar 

  • Angelelli, E., Speranza, M. G., & Tuza, Zs. (2003). Semi on-line scheduling on two parallel processors with upper bound on the items. Algorithmica, 37, 243–262.

    Article  Google Scholar 

  • Angelelli, E., Nagy, A., Speranza, M. G., & Tuza, Zs. (2004). Semi on-line multiprocessor scheduling with known sum of the tasks. Journal of Scheduling, 7, 421–428.

    Article  Google Scholar 

  • Faigle, U., Kern, W., & Turán, Gy. (1989). On the performance of on-line algorithms for particular problems. Acta Cybernetica, 9, 107–119.

    Google Scholar 

  • Fleischer, R., & Wahl, M. (2000). On-line scheduling revisited. Journal of Scheduling, 3, 343–353.

    Article  Google Scholar 

  • Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563–1581.

    Google Scholar 

  • Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 263–269.

    Google Scholar 

  • He, Y., & Zhang, G. (1999). Semi on-line scheduling on two identical machines. Computing, 62, 179–187.

    Article  Google Scholar 

  • Hoogeveen, J. A., Lenstra, J. K., & van de Velde, S. L. (1997). Sequencing and scheduling. In M. Dell’Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 181–197). New York: Wiley.

    Google Scholar 

  • Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Zs. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235–242.

    Article  Google Scholar 

  • Sgall, J. (1998). On-line scheduling. In A. Fiat & G. J. Woeginger (Eds.), Lecture notes in computer science : Vol. 1442. On-line algorithms: the state of the art (pp. 196–231). Berlin: Springer.

    Google Scholar 

  • Sleator, D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communications of ACM, 28, 202–208.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Enrico Angelelli.

Additional information

Z. Tuza is supported in part by the Hungarian Scientific Research Fund, OTKA grant T-049613.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Angelelli, E., Speranza, M.G. & Tuza, Z. Semi on-line scheduling on three processors with known sum of the tasks. J Sched 10, 263–269 (2007). https://doi.org/10.1007/s10951-007-0023-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-007-0023-y

Keywords

Navigation