Models and optimization problems for single-processor servicing of packets of objects

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.

Presented by the member of Editorial Board: A. A. Lazarev