Optimal server scheduling in nonpreemptive finite-population queueing systems

Iravani, Seyed M. R.; Krishnamurthy, Vijayalakshmi; Chao, Gary H.

doi:10.1007/s11134-006-9006-5

Cited by 12 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The third approach is to use multi-stage dynamic programming for solving the dynamic repair shop problem (Iravani et al, 2007). The goal is to construct a repair schedule at each decision epoch, marked by the arrival of newly failed aircraft to the repair shop, such that the coverage is maximized over the long term.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

Bajestani¹,

Beck²

2013

jair

View full text Add to dashboard Cite

We address a dynamic repair shop scheduling problem in the context of military aircraft fleet management where the goal is to maintain a full complement of aircraft over the long-term. A number of flights, each with a requirement for a specific number and type of aircraft, are already scheduled over a long horizon. We need to assign aircraft to flights and schedule repair activities while considering the flights requirements, repair capacity, and aircraft failures. The number of aircraft awaiting repair dynamically changes over time due to failures and it is therefore necessary to rebuild the repair schedule online. To solve the problem, we view the dynamic repair shop as successive static repair scheduling sub-problems over shorter time periods. We propose a complete approach based on the logic-based Benders decomposition to solve the static sub-problems, and design different rescheduling policies to schedule the dynamic repair shop. Computational experiments demonstrate that the Benders model is able to find and prove optimal solutions on average four times faster than a mixed integer programming model. The rescheduling approach having both aspects of scheduling over a longer horizon and quickly adjusting the schedule increases aircraft available in the long term by 10% compared to the approaches having either one of the aspects alone

show abstract

Section: Discussionmentioning

confidence: 99%

“…The literature on the scheduling of a repair shop was then extended by considering multiple repairmen, preemptive and non-preemptive repair, and different failure and repair distributions. A comprehensive review of the literature on the scheduling of a repair system is provided by Iravani, Krishnamurthy, and Chao (2007).…”

Section: Repair Shop Schedulingmentioning

confidence: 99%

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

Bajestani¹,

Beck²

2013

jair

View full text Add to dashboard Cite

show abstract

“…In an attempt to maximize both the machine efficiency and server utilization of a machine-repairman system with a single server, Bahnasawi et al (1996) use simulation to perform a sensitivity analysis of these measures. Recently, Iravani and Kolfal (2005) and Iravani et al (2006) studied machine-repairman problems with a single fully cross-trained repairman in systems with preemptive and nonpreemptive repair operations, respectively. They found conditions under which the optimal policy is a static machine priority.…”

Section: Literaturementioning

confidence: 99%

Workforce Agility in Repair and Maintenance Environments

Iravani

Krishnamurthy

2007

M&SOM

Self Cite

View full text Add to dashboard Cite

In this paper we consider workforce management in repair/maintenance environments in which repairmen are cross-trained to attend more than one type of machine. In this context, we study the machine-repairman problem with heterogeneous machines but with partially cross-trained repairmen. We introduce simple repairman-assignment rules as well as machine-priority rules that are effective in minimizing the machine downtime costs, or balancing the percentage of working machines of different types. We show that static machine priority rules are effective in minimizing systems downtime costs, while a generalized version of the longest queue policy is effective in balancing the percentage of working machines. We also introduce the concept of hidden symmetry in repair environments, and show that the well-known chain repairman skill set structure performs very well in repair environments with hidden symmetry. Finally, we provide insights into the design and control issues of repair/maintenance systems with cross-trained repairmen.machine-repairman problem, quasi-birth-and-death process, cross-training, preemption, myopic approach

show abstract

“…It was shown that the optimal policy has a switch structure. The optimal routing problems in finite-source parallel queueing system were presented in [4,5]. A classical routing problem in exponential system with K parallel heterogeneous servers was studied in [6] with respect to the SQ policy which, in general, eliminate the service rates and cost structure and to the shortest expected delay (SED) routing which takes these attributes into account.…”

Section: Introductionmentioning

confidence: 99%

Optimal Open-Loop Routing and Threshold-Based Allocation in TWO Parallel QUEUEING Systems with Heterogeneous Servers

Efrosinin

Stepanova

2021

Mathematics

View full text Add to dashboard Cite

In this paper, we study the problem of optimal routing for the pair of two-server heterogeneous queues operating in parallel and subsequent optimal allocation of customers between the servers in each queue. Heterogeneity implies different servers in terms of speed of service. An open-loop control assumes the static resource allocation when a router has no information about the state of the system. We discuss here the algorithm to calculate the optimal routing policy based on specially constructed Markov-modulated Poisson processes. As an alternative static policy, we consider an optimal Bernoulli splitting which prescribes the optimal allocation probabilities. Then, we show that the optimal allocation policy between the servers within each queue is of threshold type with threshold levels depending on the queue length and phase of an arrival process. This dependence can be neglected by using a heuristic threshold policy. A number of illustrative examples show interesting properties of the systems operating under the introduced policies and their performance characteristics.

show abstract

Optimal server scheduling in nonpreemptive finite-population queueing systems

Cited by 12 publications

References 16 publications

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

Workforce Agility in Repair and Maintenance Environments

Optimal Open-Loop Routing and Threshold-Based Allocation in TWO Parallel QUEUEING Systems with Heterogeneous Servers

Contact Info

Product

Resources

About