Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy

DOI10.1007/s11134-006-0065-4zbMath1103.60076OpenAlexW2073628071MaRDI QIDQ854999

Gideon Weiss, Ivo J. B. F. Adan

Publication date: 20 December 2006

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/analysis-of-a-simple-markovian-reentrant-line-with-infinite-supply-of-work-under-the-lbfs-policy(7c565b7e-50ff-4829-8c76-db3c453e5aa4).html

zbMATH Keywords

queueingmanufacturingpriority schedulingsteady state distributionsGI/M/1 queueinfinite virtual bufferslast buffer first served disciplineMarkovian multiclass queueing networksSample path properties

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ Synchronized reneging in queueing systems with vacations ⋮ A push-pull network with infinite supply of work ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ ON THE TIME-DEPENDENT BEHAVIOR OF A MARKOVIAN REENTRANT-LINE MODEL ⋮ Fluid model criterion for instability of re-entrant line with infinite supply of work ⋮ Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions ⋮ Stability of generalized Jackson networks with infinite supply of work ⋮ STABILITY OF A 2-STATION-5-CLASS RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK ⋮ Stability of multi-class queueing networks with infinite virtual queues ⋮ A Tandem Queueing Network with Feedback Admission Control ⋮ Jackson networks with unlimited supply of work

Uses Software

• Job Shop Simulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• In search of sensitivity in network optimization
• Re-entrant lines
• Value iteration and optimization of multiclass queueing networks
• Performance bounds for queueing networks and scheduling policies
• STABILITY OF A SIMPLE RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK : THE CASE OF EXPONENTIAL PROCESSING TIMES(<Special Issue>Network Design, Control and Optimization)
• Stability and Instability of Fluid Models for Reentrant Lines
• On the Stochastic Matrices Associated with Certain Queuing Processes