Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- 1 August 1991
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 39 (4), 648-653
- https://doi.org/10.1287/opre.39.4.648