Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/algorithmica/RosenkrantzYR01
%A Rosenkrantz, Daniel J.
%A Yu, Lin
%A Ravi, S. S.
%D 2001
%J Algorithmica
%K dblp
%N 1
%P 83-100
%T Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.
%U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica30.html#RosenkrantzYR01
%V 30
@article{journals/algorithmica/RosenkrantzYR01,
added-at = {2011-05-18T00:00:00.000+0200},
author = {Rosenkrantz, Daniel J. and Yu, Lin and Ravi, S. S.},
biburl = {https://www.bibsonomy.org/bibtex/2dd2b49b7e09ea04c65d2908648313285/dblp},
ee = {http://dx.doi.org/10.1007/s004530010079},
interhash = {3795d47fad60d0f043c23a6713b563cd},
intrahash = {dd2b49b7e09ea04c65d2908648313285},
journal = {Algorithmica},
keywords = {dblp},
number = 1,
pages = {83-100},
timestamp = {2011-05-19T11:36:01.000+0200},
title = {Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica30.html#RosenkrantzYR01},
volume = 30,
year = 2001
}
