Location of Repository

Short Note on Scheduling on a Single Machine with one Non-availability Period

By N. Megow and José Verschae

Abstract

We consider scheduling on a single machine with one non-availability period to minimize the weighted sum of completion times. We provide a preemptive algorithm with an approximation ratio arbitrarily close to the Golden Ratio, (1+ √ 5)/2+ε, which improves on a previously best known 2-approximation. The non-preemptive version of the same algorithm yields a (2 + ε)-approximation

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.180.2234
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mpi-inf.mpg.de/%7En... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.