Multi-objective routing within large scale facilities using open finite queueing networks
From MaRDI portal
Publication:1969895
DOI10.1016/S0377-2217(99)00018-1zbMath0971.90014OpenAlexW2025487488MaRDI QIDQ1969895
Laoucine Kerbache, James MacGregor Smith
Publication date: 7 November 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00018-1
decomposition methodsmathematical programmingqueueing networkslogisticsmulti-criteria decision analysisoptimal routingmaterial handling systems
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Queues and service in operations research (90B22)
Related Items
Parametric nonlinear programming for analyzing fuzzy queues with finite capacity ⋮ Performance optimization of open zero-buffer multi-server queueing networks ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method ⋮ Modelling complex assemblies as a queueing network for lead time control ⋮ An agent-based algorithm for dynamic routing in service networks ⋮ Approximate analysis of \(M/G/c/c\) state-dependent queueing networks ⋮ Queueing network models for intelligent manufacturing units with dual-resource constraints ⋮ A tractable analytical model for large-scale congested protein synthesis networks ⋮ Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization ⋮ MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW ⋮ Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories ⋮ Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers ⋮ Buffer and server allocation in general multi-server queueing networks ⋮ Dynamic facility layout problem based on open queuing network theory ⋮ Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks ⋮ Buffer allocation in general single-server queueing networks ⋮ Multiple criteria facility location problems: a survey ⋮ The multiple shortest path problem with path deconfliction ⋮ Multi-objective evacuation routing in transportation networks ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ An analytic finite capacity queueing network model capturing the propagation of congestion and blocking ⋮ Histogram based bounds and approximations for production lines ⋮ On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks ⋮ Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generalized expansion method for open finite queueing networks
- Asymptotic behavior of the expansion method for open finite queueing networks
- Manufacturing flow line systems: A review of models and analytical results
- Design of manufacturing systems using queueing models
- A study of queueing networks with deterministic service and application to computer networks
- Resource allocation in state-dependent emergency evacuation networks
- Open finite queueing networks with \(M/M/C/K\) parallel servers
- Production systems with interruptions, arbitrary topology and finite buffers
- Performance Analysis of Manufacturing Systems
- Approximating a Point Process by a Renewal Process: The View Through a Queue, an Indirect Approach
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The complexity of the network design problem
- An algorithm for sub-optimal routeing in series-parallel queueing networks
- Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems
- On Decomposition Methods for Tandem Queueing Networks with Blocking
- A Quadratically Convergent Newton-Like Method Based Upon Gaussian Elimination
- Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking