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...

Full description

Saved in:
Bibliographic Details
Published in:Automation and remote control 2016-11, Vol.77 (11), p.1994-2005
Main Authors: Kogan, D. I., Trukhina, M. A., Fedosenko, Yu. S., Sheyanov, A. V.
Format: Article
Language:English
Subjects:
Algorithms
CAE) and Design
Calculus of Variations and Optimal Control
Optimization
Collection
Computer-Aided Engineering (CAD
Control
Dynamic programming
Dynamical systems
Mathematical analysis
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Microprocessors
Optimization
Penalty function
Remote control
Robotics
Strategy
Systems Theory
Topical Issue
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117916110096