Optimal steady-state and transient trajectories of a two queue switching server

D.A.J. van Zwieten, I.J.B.F. Adan, A.A.J. Lefeber

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

We consider two fluid queues attended by a switching server and address the optimal steady-state and transient trajectory problems. The steady-state problem is formulated as a quadratic problem (QP), given a xed cycle time. Evaluating the QP problem over a range of cycle times results in the optimal steady-state trajectory. We minimize the holding costs, backlog costs and setup costs, allow setup times and allow constraints on queue contents, cycle times and service times. Second, given initial conditions, we derive the optimal transient trajectory that leads to the optimal steady-state trajectory in a nite amount of time with minimal costs. The transient switching behavior and optimal initial modes are also addressed.
Original languageEnglish
Title of host publicationValuetools 2013 (Proceedings 7th International Conference on Performance Evaluation Methodologies and Tools, Torino, Italy, December 10-12, 2013)
Pages79-87
DOIs
Publication statusPublished - 2013
Eventconference; 7th International Conference on Performance Evaluation Methodologies and Tools; 2013-12-10; 2013-12-12 -
Duration: 10 Dec 201312 Dec 2013

Conference

Conferenceconference; 7th International Conference on Performance Evaluation Methodologies and Tools; 2013-12-10; 2013-12-12
Period10/12/1312/12/13
Other7th International Conference on Performance Evaluation Methodologies and Tools

Fingerprint Dive into the research topics of 'Optimal steady-state and transient trajectories of a two queue switching server'. Together they form a unique fingerprint.

Cite this