Randomized algorithms for on-line scheduling problems : how low can't you go?

L. Stougie, A.P.A. Vestjens

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

Original language	English
Pages (from-to)	89-96
Journal	Operations Research Letters
Volume	30
Issue number	2
DOIs	https://doi.org/10.1016/S0167-6377(01)00115-8
Publication status	Published - 2002

Access to Document

@article{a72ff81acc8943519ddcdf67bb012f86,

title = "Randomized algorithms for on-line scheduling problems : how low can't you go?",

author = "L. Stougie and A.P.A. Vestjens",

year = "2002",

doi = "10.1016/S0167-6377(01)00115-8",

language = "English",

volume = "30",

pages = "89--96",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "2",

}