A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has k leaves and only k+2 nodes. The objective is to minimize the makespan. We present a pseudo-polynomial algorithm for this problem, and we also give a fully polynomial ap...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 23; no. 1; pp. 9 - 11
Main Author Schuurman, Petra
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.08.1998
Elsevier
Subjects
Applied sciences
Exact sciences and technology
Minimum delays
Operational research and scientific management
Operational research. Management science
Precedence constraints
Scheduling
Scheduling, sequencing
Precedence constraints
Minimum delays
Scheduling
Minimum time
Approximate method
Makespan
Precedence constraint
Delay
Polynomial time
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/S0167-6377(98)00012-1

Cover

More Information
Summary:We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has k leaves and only k+2 nodes. The objective is to minimize the makespan. We present a pseudo-polynomial algorithm for this problem, and we also give a fully polynomial approximation scheme.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(98)00012-1