Minimizing completion time for a class of scheduling problems
- 1 July 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 19 (1) , 27-29
- https://doi.org/10.1016/0020-0190(84)90124-8
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Optimal linear extensions by interchanging chainsProceedings of the American Mathematical Society, 1983
- A labeling algorithm to recognize a line digraph and output its root graphInformation Processing Letters, 1982
- Nombre de sauts et graphes série-parallèlesRAIRO. Informatique théorique, 1979