In this paper the authors consider single server switched network models. The characteristic of these models is the fact that many queues share a common source of service, a finite capacity server, which is able to serve at most one queue at a time and has to switch among queues from time to time. In the case discussed in this article the network consists of infinite size buffers and a single server that moves products, called jobs or work, from one buffer to another and ultimately dispatches jobs out of the network. The server can serve no more than one buffer at a time, and there is no job release from any unserved buffer. Therefore, the server has to switch among buffers from time to time, any switch consuming a nonzero switchover time. There also are incoming product flows, which bring jobs from outside the system to certain input buffers. The subsequent route of every flow through the network is pre-specified. The work is interpreted as a fluid-like substance, and the network is a fluid fabrication facility. In this context, the authors study the process performance improvement. They show the optimality of the clearing policy for fast buffers and discuss the asymptotic optimality of periodic protocols and processes.
Recensione dell'articolo:(Matveev, A. S.; Ishchenko, R. - " Near-optimality of special periodic protocols for fluid models of single server switched networks with switchover times. " - Internat. J. Control 90 (2017), no. 11, 2415–2432.) MR3704999 MathSciNet ISSN 2167-5163
Leonardo Pasini
2018-01-01
Abstract
In this paper the authors consider single server switched network models. The characteristic of these models is the fact that many queues share a common source of service, a finite capacity server, which is able to serve at most one queue at a time and has to switch among queues from time to time. In the case discussed in this article the network consists of infinite size buffers and a single server that moves products, called jobs or work, from one buffer to another and ultimately dispatches jobs out of the network. The server can serve no more than one buffer at a time, and there is no job release from any unserved buffer. Therefore, the server has to switch among buffers from time to time, any switch consuming a nonzero switchover time. There also are incoming product flows, which bring jobs from outside the system to certain input buffers. The subsequent route of every flow through the network is pre-specified. The work is interpreted as a fluid-like substance, and the network is a fluid fabrication facility. In this context, the authors study the process performance improvement. They show the optimality of the clearing policy for fast buffers and discuss the asymptotic optimality of periodic protocols and processes.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
