Parallel machine scheduling with nested job assignment restrictions

G. Muratore, U.M. Schwarz, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

31 Citations (Scopus)

Abstract

We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.
Original languageEnglish
Pages (from-to)47-50
JournalOperations Research Letters
Volume38
Issue number1
DOIs
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'Parallel machine scheduling with nested job assignment restrictions'. Together they form a unique fingerprint.

Cite this