|
Avtomatika i Telemekhanika, 2016, Issue 11, Pages 142–157
(Mi at14602)
|
|
|
|
Topical issue
Models and optimization problems for single-processor servicing of packets of objects
D. I. Kogana, M. A. Trukhinab, Yu. S. Fedosenkob, A. V. Sheyanovb a Moscow Technological University, Moscow, Russia
b Volga State University of Water Transportation, Nizhny Novgorod, Russia
Abstract:
We consider a servicing model for a stationary processor that services a finite collection of objects arriving in packets. A packet is considered to be serviced if all objects in this packet have finished servicing. For each packet, we know an individual penalty function which is monotone increasing from zero with the time a packet spends in the servicing system. We pose and study optimization problems with one and two criteria for evaluating the quality of servicing strategies. With the scheme shown in the paper, we construct a general solving algorithm based on the principle of dynamic programming and show examples of its implementation.
Citation:
D. I. Kogan, M. A. Trukhina, Yu. S. Fedosenko, A. V. Sheyanov, “Models and optimization problems for single-processor servicing of packets of objects”, Avtomat. i Telemekh., 2016, no. 11, 142–157; Autom. Remote Control, 77:11 (2016), 1994–2005
Linking options:
https://www.mathnet.ru/eng/at14602 https://www.mathnet.ru/eng/at/y2016/i11/p142
|
Statistics & downloads: |
Abstract page: | 159 | Full-text PDF : | 31 | References: | 27 | First page: | 10 |
|