Two GAMS code examples of optimizing the performance of queueing networks.

Two General Algebraic Modeling Language (GAMS) codes are presented, namely: the first one is to optimize a three-queueing network that allows one to minimize the probability of a queueing network becoming saturated, which yields the best setting of the queueing parameter for achieving the best performance of the queueing network system, reducing the rate of departure customers without being served; the second one permits to identify the best fitting of the queue storages for a fed back queueing network to minimize that the fed back queueing network becomes saturated. In both cases, we assume that customers arrive at the system with Poisson processes and time servers are exponential, and i.i.d.The GAMS source codes are the gms extension, and the GAMS report files are both lst and txt extensions