Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case

@inproceedings{Bertsimas1999OptimizationOM,
  title={Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case},
  author={Dimitris Bertsimas and Jos{\'e} Ni{\~n}o-Mora},
  year={1999}
}
We address the performance optimization problem in a single-station multiclass queueing network with changeover times by means of the achievable region approach. This approach seeks to obtain performance bounds and scheduling policies from the solution of a mathematical program over a relaxation of the system's performance region. Relaxed formulations including linear, convex, nonconvex and positive semidefinite constraints of this region are developed by formulating equilibrium relations… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules

VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Analysis of transient queues with semidefinite optimization

VIEW 5 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Stochastic Scheduling

VIEW 1 EXCERPT

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

Queues served in cyclic order

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of optimal queueing network control

Performance bounds for queueing networks and scheduling policies