What is it about?
This paper considers several open shop scheduling problems with precedence constraints and unit processing times and presents some polynomial algorithms for solving them.
Featured Image
Read the Original
This page is a summary of: Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times, RAIRO - Operations Research, January 1996, EDP Sciences,
DOI: 10.1051/ro/1996300100651.
You can read the full text:
Contributors
The following have contributed to this page
