We consider a deterministic queueing system whose dynamics can be described by a system of ordinary diﬀerential equations. The queueing system contains one servicer with two queues 1 and 2. The speed of application reception depends on the number of queue and of the time. Speed of application processing by servicers can be selected from within predetermined limits and are considered control. Speeds of processing are considered control. The problem is to minimize total lengths of queues. The necessary and suﬃcient conditions are received in the problem of piecewise constant control.
|Translated title of the contribution||EXACT PENALTY FUNCTIONS IN THE PROBLEM OF A QUEUEING SYSTEM|
|Journal||ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. СЕРИЯ 10: ПРИКЛАДНАЯ МАТЕМАТИКА, ИНФОРМАТИКА, ПРОЦЕССЫ УПРАВЛЕНИЯ|
|State||Published - 2015|
Scopus subject areas