Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.