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

@inproceedings{Megow2008ShortNO,
  title={Short Note on Scheduling on a Single Machine with one Non-availability Period},
  author={Nicole Megow and Jos{\'e} Verschae},
  year={2008}
}
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 2approximation. The non-preemptive version of the same algorithm yields a (2… CONTINUE READING