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

P. Schuurman

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)9-11
Number of pages3
JournalOperations Research Letters
Volume23
Issue number1-2
DOIs
Publication statusPublished - 1998

Fingerprint Dive into the research topics of 'A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays'. Together they form a unique fingerprint.

Cite this