Skip to main content
SpringerLink
Log in

Extension of algorithm list scheduling for a semi-online scheduling problem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

A general algorithm, called ALG, for online and semi-online scheduling problem Pm||C max with m ≥ 2 is introduced. For the semi-online version, it is supposed that all job have their processing times within the interval [p, rp], where p > 0,1 < r ≤  m/m − 1. ALG is a generalization of LS and is optimal in the sense that there is not an algorithm with smaller competitive ratio than that of ALG.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Albers S (1999) Better bounds for on-line scheduling. SIAM J Comput 29(2):459–473

    Article  Google Scholar 

  • Albers S (2002) On randomized online scheduling. In: Proceedings of the 34th ACM symposium on theory of computing. Montreal, pp 134–143

  • Coffman EE Jr, Garey MR, Johnson DS (1981) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7:1–17

    Article  Google Scholar 

  • Dósa G, He Y (2004) Semi-Online Algorithms for Parallel Machine Scheduling Problems. Computing 72:355–363

    Article  Google Scholar 

  • Goldberg RR, Shapiro J (2001) Extending Graham’s result on scheduling to other heuristic. Oper Res Lett 29:149–153

    Article  Google Scholar 

  • Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17:416–429

    Article  Google Scholar 

  • Faigle U, Kern W, Turán G (1989) On the performance of on-line algorithm for particular problems. Acta Cybern 9:107–119

    Google Scholar 

  • He Y (2000) The optimal on-line parallel machine scheduling. Comput Math Appl 39:117–121

    Article  Google Scholar 

  • He Y, Dósa G (2005) Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. Discrete Appl Math 150:140–159

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235–242

    Article  Google Scholar 

  • Karger DR, Phillips SJ, Torng E (1996) A better algorithm for an ancient scheduling problem. J Algorithms 20 (2):400–430

    Article  Google Scholar 

  • Sgall J (1998) On-line scheduling. On-line algorithms: the state of art. Lecture Notes in Computer Sciences, vol 1442. Springer, Berlin Heidelberg New York, pp 196–231

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang University, Hangzhou, 310027, People’s Republic of China

    Yong He

  2. Department of Mathematics, Pannon University, Veszprém, Hungary

    György Dósa

Authors
  1. Yong He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Dósa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yong He.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, Y., Dósa, G. Extension of algorithm list scheduling for a semi-online scheduling problem. cent.eur.j.oper.res. 15, 97–104 (2007). https://doi.org/10.1007/s10100-006-0003-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-006-0003-x

Keywords

Search

Navigation