| Article ID: | iaor19921555 |
| Country: | United Kingdom |
| Volume: | 29 |
| Start Page Number: | 94 |
| End Page Number: | 105 |
| Publication Date: | Jun 1989 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Lushchakova I.N. |
An algorithm is proposed for time-optimal scheduling of a set of jobs in a two-stage queueing system with resource constraints and without prescribed flow paths. The complexity of the algorithm is linear in the number of jobs.