TY - GEN A1 - Megow, Nicole A1 - Verschae, Jose T1 - Short Note on Scheduling on a Single Machine with one Non-availability Period N2 - 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+\sqrt{5})/2+\eps$, which improves on a previously best known~$2$-approximation. The non-preemptive version of the same algorithm yields a~$(2+\eps)$-approximation. Y1 - 2009 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/539 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-5392 ER -