Two-stage queueing systems with resource constraints and without prescribed flow paths

DOI10.1016/0041-5553(89)90183-3zbMath0712.90034OpenAlexW2056661164MaRDI QIDQ3197608

Irina N. Lushchakova, Vitaly A. Strusevich

Publication date: 1989

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(89)90183-3

zbMATH Keywords

makespanpolynomial-time algorithmpreemptionresource constraintsarbitrary processing timestwo machine open nonpreemptive scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Scheduling two jobs with fixed and nonfixed routes

This page was built for publication: Two-stage queueing systems with resource constraints and without prescribed flow paths