On the Complexity of Non-preemptive Shop Scheduling with Two Jobs

Tamás Kis. On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. Computing, 69(1):37-49, 2002. [doi]

Abstract

Abstract is missing.