Mathematical Programming

, Volume 106, Issue 1, pp 137–157

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates

  • Mabel C. Chou
  • Maurice Queyranne
  • David Simchi-Levi

DOI: 10.1007/s10107-005-0588-1

Cite this article as:
Chou, M., Queyranne, M. & Simchi-Levi, D. Math. Program. (2006) 106: 137. doi:10.1007/s10107-005-0588-1


Jobs arriving over time must be non-preemptively processed on one of m parallel machines, each running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arrives. The Weighted Shortest Processing Requirement (WSPR) heuristic is a simple extension of the well known WSPT heuristic, which is optimal for the single machine problem without release dates. According to WSPR, whenever a machine completes a job, the next job assigned to it is the one with the least ratio of processing requirement to weight among all jobs available for processing at this point in time. We analyze the performance of this heuristic and prove that its asymptotic competitive ratio is one for all instances with bounded job processing requirements and weights. This implies that the WSPR algorithm generates a solution whose relative error approaches zero as the number of jobs increases. Our proof does not require any probabilistic assumption on the job parameters and relies extensively on properties of optimal solutions to a single machine relaxation of the problem.


Scheduling Asymptotic Performance Ratio On-line algorithms Analysis of Heuristics 

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mabel C. Chou
    • 1
  • Maurice Queyranne
    • 2
  • David Simchi-Levi
    • 3
  1. 1.Dept. of Decision SciencesNational University of SingaporeSingapore
  2. 2.Faculty of Commerce and Business AdministrationUniversity of British ColumbiaCanada
  3. 3.Dept. of Civil and Environmental EngineeringMassachusetts Institute of TechnologyUSA

Personalised recommendations