An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity

Lu Lu, Marc E. Posner. An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity. Math. Oper. Res., 18(1):12-38, 1993. [doi]

Abstract

Abstract is missing.