![]() |
@article{DBLP:journals/computing/Kis02,
author = {Tam{\'a}s Kis},
title = {On the Complexity of Non-preemptive Shop Scheduling with
Two Jobs},
journal = {Computing},
volume = {69},
number = {1},
year = {2002},
pages = {37-49},
ee = {http://www.link.springer.de/link/service/journals/00607/bibs/2069001/20690037.htm},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2005-03-14 by Michael Ley (ley@uni-trier.de)