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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.