A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

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

Original language	English
Pages (from-to)	105-122
Journal	Theoretical Computer Science
Volume	237
Issue number	1-2
DOIs	https://doi.org/10.1016/S0304-3975(98)00157-1
Publication status	Published - 2000

Cite this

@article{1b8a99565bbc49c09a54229baebe62f2,

title = "A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem",

author = "P. Schuurman and G.J. Woeginger",

year = "2000",

doi = "10.1016/S0304-3975(98)00157-1",

language = "English",

volume = "237",

pages = "105--122",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

AU - Schuurman, P.

AU - Woeginger, G.J.

PY - 2000

Y1 - 2000

U2 - 10.1016/S0304-3975(98)00157-1

DO - 10.1016/S0304-3975(98)00157-1

M3 - Article

VL - 237

SP - 105

EP - 122

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -