An approximation algorithm for a single-machine scheduling problem with release times and delivery times

doi:10.1016/0166-218X(92)00110-8

Discrete Applied Mathematics

Volume 48, Issue 1, 4 January 1994, Pages 69-79

https://doi.org/10.1016/0166-218X(92)00110-8 Get rights and content

Under an Elsevier user license

open archive

Abstract

We consider the scheduling problem in which jobs with release times and delivery times are to be scheduled on one machine. We present a 3/2-approximation algorithm which runs in O(n log n) time and a new robust lower bound for this problem. The known until the present 3/2-approximation algorithm has O(n²log n) computational complexity.

Keywords

Scheduling

approximation algorithm

worst-case analysis