A review of open queueing network models of manufacturing systems
From MaRDI portal
Publication:1205351
DOI10.1007/BF01158637zbMath0782.90047OpenAlexW2000022994MaRDI QIDQ1205351
Gabriel R. Bitran, Sriram Dasu
Publication date: 1 April 1993
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158637
manufacturing systemsdesignqueueing networkplanningopen queueing networkapproximation proceduresBrownian controlparametric decomposition approach
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Production models (90B30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm ⋮ Dependence among single stations in series and its applications in productivity improvement ⋮ Design and operation of manufacturing systems: A controls-based synthesis ⋮ Stabilizing performance in a single-server queue with time-varying arrival rate ⋮ Firms, queues, and coffee breaks: a flow model of corporate activity with delays ⋮ Operational capacity allocation for unreliable module-based assembly systems. ⋮ Design of manufacturing systems using queueing models ⋮ A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Modeling and analysis of machine sharing in manufacturing systems ⋮ An analytic formula for the mean throughput of \(K\)-station production lines with no intermediate buffers ⋮ Modeling and analysis of a Canadian Forces Geomatics division workflow ⋮ Optimization of static traffic allocation policies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The time spent in a dynamic job shop
- Capacity planning in manufacturing networks with discrete options
- Reducing work-in-process inventory in certain classes of flexible manufacturing systems
- On queueing network models of flexible manufacturing systems
- Capacity allocation in generalized Jackson networks
- Machine allocation problems in manufacturing networks
- Throughput analysis in manufacturing networks
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Optimal Control of a Two-Station Brownian Network
- Waiting Times When Queues are in Tandem
- Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
- New results on the single server queue with a batch markovian arrival process
- Dynamic Scheduling of a Four-Station Queueing Network
- On queueing systems with renewal departure processes
- Approximations for departure processes and queues in series
- Queueing Networks: A Survey of Their Random Processes
- Open and Closed Models for Networks of Queues
- The Best Order for Queues in Series
- A Tactical Planning Model for a Job Shop
- Lot Sizes, Lead Times and In-Process Inventories
- Optimal static load balancing in distributed computer systems
- Brownian models of open queueing networks with homogeneous customer populations∗
- Stochastic majorization of random variables by proportional equilibrium rates
- Strong Convexity Results for Queueing Systems
- Reducing the Congestion in a Class of Job Shops
- An Approximation Method for Tandem Queues with Blocking
- Approximations for the time spent in a dynamic job shop with applications to due-date assignment
- M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
- Some equivalencies between closed queueing networks with blocking
- Approximations for Product Departures from a Single-Server Station with Batch Processing in Multi-Product Queues
- Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
- A versatile Markovian point process
- The N/G/1 queue and its detailed analysis
- Approximations of the Mean Waiting Time in an M/G/s Queueing System
- Mean-Value Analysis of Closed Multichain Queuing Networks
- The Distribution of Queuing Network States at Input and Output Instants
- A Review of Production Scheduling
- Note—Some Results on Sojourn Times in Acyclic Jackson Networks
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Linear Control of a Markov Production System
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Networks of queues with customers of different types
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Notes Approximate Explicit Formulae For The Average Queueing Time In The Processes (M/D/r) and (D/M/r)
- Note—On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues
- A Survey of Scheduling Rules
- State-of-the-Art—Networks of Queues—A Survey of Equilibrium Analysis
- Steady state waiting time in a multicenter job shop
- Approximate Analysis of General Queuing Networks by Decomposition
- The Complexity of Flowshop and Jobshop Scheduling
- Approximating Nonrenewal Processes by Markov Chains: Use of Super-Erlang (SE) Chains
- Analysis of the ΣPhi/Ph/1 Queue
- Accuracy of the Diffusion Approximation for Some Queuing Systems
- A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues
- Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers
- Point processes generated by transitions of Markov chains
- Analysis of Job Flow-Time in a Job Shop
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
- A delay dependent queue discipline
- Reduction Methods for Tandem Queuing Systems
- Some Inequalities in Queuing
