A note on the complexity of the concurrent open shop problem

Thomas A. Roemer. A note on the complexity of the concurrent open shop problem. J. Scheduling, 9(4):389-396, 2006. [doi]

No reviews for this publication, yet.