Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorial Optimization and Applications

COCOA 2009: Combinatorial Optimization and Applications pp 354–362Cite as

A Note on Online Scheduling for Jobs with Arbitrary Release Times

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5573))

Abstract

We investigate the problem of on-line scheduling for jobs with arbitrary release times on m identical parallel machines. The goal is to minimize the makespan. We derive a best possible online algorithm with competitive ratio of 2 for m = 2. For a special case that all the jobs have unit processing times, we prove that Algorithm LS has a tight bound of 3/2 for general m machines.

This work has been supported by NSFC (60573020).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM Journal on Applied Mathematics 17, 416–429 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  2. Li, R., Huang, H.C.: On-line Scheduling for Jobs with Arbitrary Release Times. Computing 73, 79–97 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Li, R., Huang, H.C.: List Scheduling for Jobs with Arbitrary Release Times and Similar Lengths. Journal of Scheduling 10, 365–373 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Operations Research and Management Science, Qufu Normal University, Rizhao, 276826, China

    Jihuan Ding

  2. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Jihuan Ding & Guochuan Zhang

Authors
  1. Jihuan Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guochuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 800 West Campbell Road, TX 75080-3021, Richardson, USA

    Ding-Zhu Du

  2. Chinese Academy of Sciences, Institute of Applied Mathematics, Zhong Guan Cun Dong Lu 55, 100190, Beijing, P. R. China

    Xiaodong Hu

  3. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, P.O. Box 116595, FL 32611-6595, Gainesville, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, J., Zhang, G. (2009). A Note on Online Scheduling for Jobs with Arbitrary Release Times. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02026-1_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02025-4

  • Online ISBN: 978-3-642-02026-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation