Prioritized customer order scheduling to maximize throughput
From MaRDI portal
Publication:323536
DOI10.1016/J.EJOR.2016.05.066zbMATH Open1346.90408OpenAlexW2410818007MaRDI QIDQ323536FDOQ323536
Authors: Yaping Zhao, Yanni Liu, Xiaoyun Xu, Haidong Li
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.066
Recommendations
- Throughput maximization in a loss queueing system with heterogeneous servers
- Optimal static distribution of prioritized customers to heterogeneous parallel servers
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers
- Optimal server assignment for a multiple customer classes problem
Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Stability of Multiclass Queueing Networks Under Priority Service Disciplines
- Stability and Instability of Fluid Models for Reentrant Lines
- Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules
- Closed two node priority queueing networks
- Instability of FIFO queueing networks
- A multiclass network with non-linear, non-convex, non-monotonic stability conditions
- Stabilizing priority fluid queueing network model
- Ergodicity of stochastic processes describing the operation of open queueing networks
- Maximizing throughput in queueing networks with limited flexibility
- Dynamic load balancing in parallel queueing systems: stability and optimal control
- Dynamic task assignment for throughput maximization with worksharing
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- Stabilizing Batch-Processing Networks
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- Priority Queuing Networks
- "First come, first served" can be unstable!
- Maximizing throughput in finite-source parallel queue systems
- Multi-state throughput analysis of a two-stage manufacturing system with parallel unreliable machines and a finite buffer
- Stability of queueing networks and scheduling policies
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Prioritized customer order scheduling to maximize throughput
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323536)