Viswanath Nagarajan, Maxim Sviridenko. Tight Bounds for Permutation Flow Shop Scheduling. In Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi, editors, Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings. Volume 5035 of Lecture Notes in Computer Science, pages 154-168, Springer, 2008. [doi]
@inproceedings{NagarajanS08,
title = {Tight Bounds for Permutation Flow Shop Scheduling},
author = {Viswanath Nagarajan and Maxim Sviridenko},
year = {2008},
doi = {10.1007/978-3-540-68891-4_11},
url = {http://dx.doi.org/10.1007/978-3-540-68891-4_11},
tags = {data-flow},
researchr = {https://researchr.org/publication/NagarajanS08},
cites = {0},
citedby = {0},
pages = {154-168},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi},
volume = {5035},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-68886-0},
}