Article ID Journal Published Year Pages File Type
1142974 Operations Research Letters 2009 5 Pages PDF
Abstract

We investigate the scheduling problem with release dates and deadlines on a minimum number of machines. In the case of equal release dates, we present a 2-approximation algorithm. We also show that Greedy Best-Fit (GBF) is a 6-approximation algorithm for the case of equal processing times.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Scheduling with a minimum number of machines
Authors
, ,