Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu. An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling. In Laura Kovács, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie, editors, 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania, September 21-24, 2015. pages 153-159, IEEE, 2015. [doi]
@inproceedings{AndreiCR15,
title = {An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling},
author = {Stefan Andrei and Albert M. K. Cheng and Vlad Radulescu},
year = {2015},
doi = {10.1109/SYNASC.2015.32},
url = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2015.32},
researchr = {https://researchr.org/publication/AndreiCR15},
cites = {0},
citedby = {0},
pages = {153-159},
booktitle = {17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania, September 21-24, 2015},
editor = {Laura Kovács and Viorel Negru and Tetsuo Ida and Tudor Jebelean and Dana Petcu and Stephen M. Watt and Daniela Zaharie},
publisher = {IEEE},
isbn = {978-1-5090-0461-4},
}