Tamás Kis On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. 37-49 2002 1 69 Computing http://www.link.springer.de/link/service/journals/00607/bibs/2069001/20690037.htm db/journals/computing/computing69.html#Kis02