Konstantinos Kalpakis, Yaacov Yesha. Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. Algorithmica, 23(2):159-179, 1999. [doi]
@article{KalpakisY99,
title = {Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays},
author = {Konstantinos Kalpakis and Yaacov Yesha},
year = {1999},
url = {http://link.springer.de/link/service/journals/00453/bibs/23n2p159.html},
researchr = {https://researchr.org/publication/KalpakisY99},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {23},
number = {2},
pages = {159-179},
}