Inhomogeneous deterministic two-stage queueing systems

DOI10.1007/BF01069997MaRDI QIDQ4007322zbMATH OpenOpenAlexFDO

Authors V. A. Strusevich

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069997

zbMATH Keywords

inhomogeneous two-stage queueing systemspolynomial-time algorithmtime-optimal schedule

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 22879
• Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers
• scientific article; zbMATH DE number 555729
• Optimal selection of mean waiting times in \(GI| M_ n| 1\) systems
• A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue

Cites work

• Flowshop and Jobshop Schedules: Complexity and Approximation
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Complexity of Flowshop and Jobshop Scheduling
• The mixed shop scheduling problem

Cited in

(2)

• scientific article; zbMATH DE number 3924482 (Why is no real title available?)
• Optimal choice of machine speeds for two-stage non-homogeneous systems

This page was built for publication: Inhomogeneous deterministic two-stage queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007322)