Heuristics for allocation of reconfigurable resources in a serial line with reliability considerations

Cheng‐Hung Wu · Douglas G. Down

33 citations0/0 files storedIIE Transactions

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Reliability and Maintenance Optimization Scheduling and Optimization Algorithms

Abstract

We consider the allocation of reconfigurable resources in a serial line with machine failures. Each station is equipped with non-idling dedicated servers while the whole system is equipped with a finite number of reconfigurable servers. The reconfigurable servers are available to be assigned to any station and all servers are allowed to collaborate on a single job. We provide conditions for a policy to achieve throughput optimality. We also show in the two-station case that transition monotone optimal policies exist. We discuss heuristics based on the two-server model that reduce average holding costs significantly. These heuristics are compared to several heuristics from the literature via a detailed numerical study.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 33 citations exist upstream.

References

1984Discrete-Event System Simulation 2000Stochastic Dynamic Programming and the Control of Queueing Systems 1995Stability and convergence of moments for multiclass queueing networks via fluid limit models 2004Agile workforce evaluation: a framework for cross-training and coordination 1984Optimal control of two interacting service stations 1987Optimal control of service rates in networks of queues 1998Stochastic Dynamic Programming and the Control of Queueing Systems 2001Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems

Cited by

2020Assigning spontaneous volunteers to relief efforts under uncertainty in task demand and volunteer availability 2014OPTIMAL CONTROL OF A TWO-SERVER QUEUEING SYSTEM WITH FAILURES 2007DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES 2010Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.