Skip to main content
SpringerLink
Log in

On-line Scheduling for Jobs with Arbitrary Release Times

  • Published:
Computing 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 on m parallel identical machines. A tight bound is given for List Scheduling(LS) algorithm and a better algorithm is given for m≥2.

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

Author information

Authors and Affiliations

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

    R. Li

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

    H.-C. Huang

Authors
  1. R. Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H.-C. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Li.

Additional information

AMS Subject Classifications: 90B35 (90C27).

This research is supported by Singapore-MIT Alliance.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, R., Huang, HC. On-line Scheduling for Jobs with Arbitrary Release Times. Computing 73, 79–97 (2004). https://doi.org/10.1007/s00607-004-0067-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-004-0067-1

Keywords

Search

Navigation