Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers - MaRDI portal

Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers

From MaRDI portal
Publication:5322110

DOI10.1287/opre.1040.0200zbMath1165.90383OpenAlexW2167738349MaRDI QIDQ5322110

Hayriye Ayhan, Sigrún Andradóttir

Publication date: 18 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1040.0200




Related Items (23)

Sample Path Optimal Policies for Serial Lines with Flexible WorkersSERVER COORDINATION IN QUEUEING SYSTEMS: WHEN AND HOW?An optimal deterministic control policy of servers in front and back rooms with a variable number of switching points and switching costsOptimal control of queueing systems with non-collaborating serversCooperation and sharing costs in a tandem queueing networkThe analysis, optimization, and simulation of a two-stage tandem queueing model with hyperexponential service time at second stageCost sharing of cooperating queues in a Jackson networkOptimal assignment of servers to tasks when collaboration is inefficientTwo‐class constrained optimization with applications to queueing controlMAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERSDynamic control of a tandem system with abandonmentsMaximizing throughput in queueing networks with limited flexibilityDynamic server allocation for unstable queueing networks with flexible serversProfit maximization in flexible serial queueing networksThroughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjectureRobustness of efficient server assignment policies to service time distributions in finite-buffered linesInventory based allocation policies for flexible servers in serial systemsPartial pooling in tandem lines with cooperation and blockingDYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINESOptimizing the interaction between residents and attending physiciansAsymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated ServersOptimal server assignment in a two-stage tandem queueing systemA linear programming based approach for composite-action Markov decision processes







This page was built for publication: Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers