What is it about?
This paper gives a polynomial algorithm for the open shop problem with unit processing times, tree precedence constraints and minimization of makespan.
Featured Image
Read the Original
This page is a summary of: A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem, European Journal of Operational Research, January 1994, Elsevier,
DOI: 10.1016/0377-2217(94)90335-2.
You can read the full text:
Contributors
The following have contributed to this page
