Parallel machine scheduling with nested job assignment restrictions

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

doi:10.1016/j.orl.2009.09.010

Parallel machine scheduling with nested job assignment restrictions

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

Research output: Contribution to journal › Article › Academic › peer-review

34 Citations (Scopus)

Abstract

We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.

Original language	English
Pages (from-to)	47-50
Journal	Operations Research Letters
Volume	38
Issue number	1
DOIs	https://doi.org/10.1016/j.orl.2009.09.010
Publication status	Published - 2010

Access to Document

10.1016/j.orl.2009.09.010

Cite this

@article{774cadc902364ef696e811cc721a245f,

title = "Parallel machine scheduling with nested job assignment restrictions",

abstract = "We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.",

author = "G. Muratore and U.M. Schwarz and G.J. Woeginger",

year = "2010",

doi = "10.1016/j.orl.2009.09.010",

language = "English",

volume = "38",

pages = "47--50",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Parallel machine scheduling with nested job assignment restrictions

AU - Muratore, G.

AU - Schwarz, U.M.

AU - Woeginger, G.J.

PY - 2010

Y1 - 2010

N2 - We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.

AB - We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.

U2 - 10.1016/j.orl.2009.09.010

DO - 10.1016/j.orl.2009.09.010

M3 - Article

SN - 0167-6377

VL - 38

SP - 47

EP - 50

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

ER -

Parallel machine scheduling with nested job assignment restrictions

Abstract

Access to Document

Fingerprint

Cite this