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]

Authors

Thomas A. Roemer

This author has not been identified. Look up 'Thomas A. Roemer' in Google