The time spent in a dynamic job shop

DOI10.1016/0377-2217(84)90236-4zbMath0539.60091OpenAlexW1972033620MaRDI QIDQ794063

J. George Shanthikumar, John A. Buzacott

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90236-4

zbMATH Keywords

simulation resultsopen queueing networklocal scheduling disciplines

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

On queueing network models of flexible manufacturing systems ⋮ On reducing time spent in M/G/1 systems ⋮ Approximations for the time spent in a dynamic job shop with applications to due-date assignment ⋮ Parts routing in a felxible manufacturing system with time-varying demands ⋮ A review of open queueing network models of manufacturing systems ⋮ Two-stage queueing network models for quality control and testing

Cites Work

• Unnamed Item
• Unnamed Item
• On reducing time spent in M/G/1 systems
• Comparison of dispatch policies for a single server queueing model with limited operational control
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Sequential Stopping Rules for the Regenerative Method of Simulation
• A Survey of Scheduling Rules
• Steady state waiting time in a multicenter job shop