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]
@article{LuP93,
title = {An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity},
author = {Lu Lu and Marc E. Posner},
year = {1993},
doi = {10.1287/moor.18.1.12},
url = {http://dx.doi.org/10.1287/moor.18.1.12},
researchr = {https://researchr.org/publication/LuP93},
cites = {0},
citedby = {0},
journal = {Math. Oper. Res.},
volume = {18},
number = {1},
pages = {12-38},
}