×

Jackson’s rule for single-machine scheduling: Making a good heuristic better. (English) Zbl 0781.90052

The authors consider the scheduling problem in which jobs with release dates and delivery times are to be scheduled on one machine. They present a 4/3-approximation algorithm for the problem with precedence constraints among the jobs, and two polynomial approximation schemes for the problem without precedence constraints. At the core of each of the algorithms Jackson’s Rule – a simple but seemingly robust heuristic for the problem – is presented.

MSC:

90B35 Deterministic scheduling theory in operations research
90-08 Computational methods for problems pertaining to operations research and mathematical programming
PDFBibTeX XMLCite
Full Text: DOI Link