Skip to main content
Springer Nature Link
Log in

List scheduling for jobs with arbitrary release times and similar lengths

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /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 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

Explore related subjects

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

References

  • Azar, Y., & Regev, O. (2001). On-line bin stretching. Theoretical Computer Science, 268, 17–41.

    Article  Google Scholar 

  • Dósa, G., & He, Y. (2004). Semi-online algorithms for parallel machine scheduling problems. Computing, 72, 355–363.

    Article  Google Scholar 

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

    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. (1991). Bounds for non-preemptive scheduling jobs with similar processing times on multiprocessor systems using LPT-algorithm. Computing, 46, 183–191.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Li, R., & Huang, H. C. (2004). On-line scheduling for jobs with arbitrary release times. Computing, 73, 79–97.

    Article  Google Scholar 

  • Liu, W. P., Sidney, J. B., & Vliet, A. (1996). Ordinal algorithm for parallel machine scheduling. Operations Research Letters, 18, 223–232.

    Article  Google Scholar 

  • Seiden, S., Sgall, J., & Woeginger, G. J. (2000). Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27, 215–227.

    Article  Google Scholar 

  • Tan, Z. Y., & He, Y. (2002). Semi-online problem on two identical machines with combined partial information. Operations Research Letters, 30, 408–414.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hunan Normal University, Changsha, 410081, Hunan Provence, China

    Rongheng Li

  2. Department of Industrial and Systems Engineering, National University of Singapore, 1 Engineering Drive 2, Singapore, 117576, Singapore

    Huei-Chuen Huang

Authors
  1. Rongheng Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Huei-Chuen Huang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Huei-Chuen Huang.

Additional information

Li’s work was supported in part by the National Natural Science Foundation of China (No. 10771060).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, R., Huang, HC. List scheduling for jobs with arbitrary release times and similar lengths. J Sched 10, 365–373 (2007). https://doi.org/10.1007/s10951-007-0042-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-007-0042-8

Keywords