TY - CONF
TI - Approximation schemes for constrained scheduling problems
T2 - 30th Annual Symposium on Foundations of Computer Science(FOCS)
SP - 134
EP - 139
AU - D. Shmoys
AU - L. Hall
PY - 1989
KW - precedence-constrained scheduling problems
KW - minimisation
KW - single machine problem
KW - constrained scheduling problems
KW - polynomial approximation
KW - maximum completion time
KW - two-machine flow shop
KW - release dates
KW - maximum lateness
KW - parallel-machine problem
KW - outline
DO - 10.1109/SFCS.1989.63468
JO - 30th Annual Symposium on Foundations of Computer Science(FOCS)
SN - 0-8186-1982-1
VO - 10.1109/SFCS.1989.63468
VL - 00
JA - 30th Annual Symposium on Foundations of Computer Science(FOCS)
Y1 - October 1989
ER -