Pages that link to "Item:Q3114740"

The following pages link to Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems (Q3114740):

Displaying 37 items.

• Prioritized customer order scheduling to maximize throughput (Q323536) (← links)
• Optimal control of queueing systems with non-collaborating servers (Q333457) (← links)
• Optimal assignment of servers to tasks when collaboration is inefficient (Q364078) (← links)
• Flexible servers in tandem lines with setup costs (Q383223) (← links)
• Dynamic server allocation for unstable queueing networks with flexible servers (Q430003) (← links)
• Profit maximization in flexible serial queueing networks (Q475122) (← links)
• Throughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjecture (Q543558) (← links)
• Pooling in tandem queueing networks with non-collaborative servers (Q1688935) (← links)
• Dynamic control of a tandem system with abandonments (Q1691912) (← links)
• Front-office multitasking between service encounters and back-office tasks (Q2023983) (← links)
• Stationary analysis of certain Markov-modulated reflected random walks in the quarter plane (Q2115768) (← links)
• Server assignment policies in queues with customer abandonments (Q2146417) (← links)
• Inventory based allocation policies for flexible servers in serial systems (Q2267291) (← links)
• Optimal pricing for tandem queues with finite buffers (Q2284391) (← links)
• Staff assignment policies for a mass casualty event queuing network (Q2288950) (← links)
• Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration (Q2333138) (← links)
• Maximizing throughput in queueing networks with limited flexibility (Q2426560) (← links)
• A tandem queue with coupled processors: Computational issues (Q2494528) (← links)
• On the introduction of an agile, temporary workforce into a tandem queueing system (Q2494533) (← links)
• Partial pooling in tandem lines with cooperation and blocking (Q2494537) (← links)
• Optimal dynamic assignment of a flexible worker on an open production line with specialists (Q2572254) (← links)
• OPTIMAL STATIC ASSIGNMENT AND ROUTING POLICIES FOR SERVICE CENTERS WITH CORRELATED TRAFFIC (Q2875236) (← links)
• Sample Path Optimal Policies for Serial Lines with Flexible Workers (Q2897164) (← links)
• MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS (Q3503172) (← links)
• Robustness of efficient server assignment policies to service time distributions in finite-buffered lines (Q3588808) (← links)
• Optimal control of a flexible server (Q4464170) (← links)
• Exact tail asymptotics for a two-stage queue: Complete solution <i>via </i>kernel method (Q4578171) (← links)
• Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers (Q4689399) (← links)
• Kelly and Jackson networks with interchangeable, cooperative servers (Q5022270) (← links)
• SERVER COORDINATION IN QUEUEING SYSTEMS: WHEN AND HOW? (Q5051226) (← links)
• Multi-Actor Markov Decision Processes (Q5312837) (← links)
• A TWO-CLASS RETRIAL SYSTEM WITH COUPLED ORBIT QUEUES (Q5358109) (← links)
• Dynamic load balancing with flexible workers (Q5395353) (← links)
• Incentive Effects of Multiple-Server Queueing Networks: The Principal-Agent Perspective (Q5406904) (← links)
• DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES (Q5433635) (← links)
• OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS (Q5450693) (← links)
• Two‐class constrained optimization with applications to queueing control (Q6079109) (← links)