Loading…

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!

cited_by
cites	cdi_FETCH-LOGICAL-c301t-41911d30b726ae9e166bd3b61bdfb82c88f6355e17b958d7eb9b19dc4e047dcf3
container_end_page	2005
container_issue	11
container_start_page	1994
container_title	Automation and remote control
container_volume	77
creator	Kogan, D. I. Trukhina, M. A. Fedosenko, Yu. S. Sheyanov, A. V.
description	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.
doi_str_mv	10.1134/S0005117916110096
format	article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1893916506</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1893916506</sourcerecordid><originalsourceid>FETCH-LOGICAL-c301t-41911d30b726ae9e166bd3b61bdfb82c88f6355e17b958d7eb9b19dc4e047dcf3</originalsourceid><addsrcrecordid>eNp1kE9LxDAQxYMouK5-AG8FL16qmaZNk6Ms_gPFg-65NMl06dptaqYr6Kc3ZT2I4mmGN783PB5jp8AvAER--cw5LwBKDRKAcy332AwkV6ngIttns-mcTvdDdkS05jxSmZix5aN32FFS9y7xw9hu2s96bH2fDMGbDjeUND4k1ParDtOoWSSaBAzvrY1q4ptkqO0rjjSt3qzRjnTMDpq6Izz5nnO2vLl-WdylD0-394urh9QKDmOagwZwgpsykzVqBCmNE0aCcY1RmVWqkaIoEEqjC-VKNNqAdjZHnpfONmLOznd_Y7K3LdJYbVqy2HV1j35LFSgtYiMFlxE9-4Wu_Tb0MV2kFFd5lkEeKdhRNniigE01hHZTh48KeDUVXf0pOnqynYci268w_Pj8r-kLG0Z_gA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1880842214</pqid></control><display><type>article</type><title>Models and optimization problems for single-processor servicing of packets of objects</title><source>Springer Link</source><creator>Kogan, D. I. ; Trukhina, M. A. ; Fedosenko, Yu. S. ; Sheyanov, A. V.</creator><creatorcontrib>Kogan, D. I. ; Trukhina, M. A. ; Fedosenko, Yu. S. ; Sheyanov, A. V.</creatorcontrib><description>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.</description><identifier>ISSN: 0005-1179</identifier><identifier>EISSN: 1608-3032</identifier><identifier>DOI: 10.1134/S0005117916110096</identifier><language>eng</language><publisher>Moscow: Pleiades Publishing</publisher><subject>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</subject><ispartof>Automation and remote control, 2016-11, Vol.77 (11), p.1994-2005</ispartof><rights>Pleiades Publishing, Ltd. 2016</rights><rights>Copyright Springer Science & Business Media 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c301t-41911d30b726ae9e166bd3b61bdfb82c88f6355e17b958d7eb9b19dc4e047dcf3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Kogan, D. I.</creatorcontrib><creatorcontrib>Trukhina, M. A.</creatorcontrib><creatorcontrib>Fedosenko, Yu. S.</creatorcontrib><creatorcontrib>Sheyanov, A. V.</creatorcontrib><title>Models and optimization problems for single-processor servicing of packets of objects</title><title>Automation and remote control</title><addtitle>Autom Remote Control</addtitle><description>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.</description><subject>Algorithms</subject><subject>CAE) and Design</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Collection</subject><subject>Computer-Aided Engineering (CAD</subject><subject>Control</subject><subject>Dynamic programming</subject><subject>Dynamical systems</subject><subject>Mathematical analysis</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Mechanical Engineering</subject><subject>Mechatronics</subject><subject>Microprocessors</subject><subject>Optimization</subject><subject>Penalty function</subject><subject>Remote control</subject><subject>Robotics</subject><subject>Strategy</subject><subject>Systems Theory</subject><subject>Topical Issue</subject><issn>0005-1179</issn><issn>1608-3032</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp1kE9LxDAQxYMouK5-AG8FL16qmaZNk6Ms_gPFg-65NMl06dptaqYr6Kc3ZT2I4mmGN783PB5jp8AvAER--cw5LwBKDRKAcy332AwkV6ngIttns-mcTvdDdkS05jxSmZix5aN32FFS9y7xw9hu2s96bH2fDMGbDjeUND4k1ParDtOoWSSaBAzvrY1q4ptkqO0rjjSt3qzRjnTMDpq6Izz5nnO2vLl-WdylD0-394urh9QKDmOagwZwgpsykzVqBCmNE0aCcY1RmVWqkaIoEEqjC-VKNNqAdjZHnpfONmLOznd_Y7K3LdJYbVqy2HV1j35LFSgtYiMFlxE9-4Wu_Tb0MV2kFFd5lkEeKdhRNniigE01hHZTh48KeDUVXf0pOnqynYci268w_Pj8r-kLG0Z_gA</recordid><startdate>20161101</startdate><enddate>20161101</enddate><creator>Kogan, D. I.</creator><creator>Trukhina, M. A.</creator><creator>Fedosenko, Yu. S.</creator><creator>Sheyanov, A. V.</creator><general>Pleiades Publishing</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20161101</creationdate><title>Models and optimization problems for single-processor servicing of packets of objects</title><author>Kogan, D. I. ; Trukhina, M. A. ; Fedosenko, Yu. S. ; Sheyanov, A. V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c301t-41911d30b726ae9e166bd3b61bdfb82c88f6355e17b958d7eb9b19dc4e047dcf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>CAE) and Design</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Collection</topic><topic>Computer-Aided Engineering (CAD</topic><topic>Control</topic><topic>Dynamic programming</topic><topic>Dynamical systems</topic><topic>Mathematical analysis</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Mechanical Engineering</topic><topic>Mechatronics</topic><topic>Microprocessors</topic><topic>Optimization</topic><topic>Penalty function</topic><topic>Remote control</topic><topic>Robotics</topic><topic>Strategy</topic><topic>Systems Theory</topic><topic>Topical Issue</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kogan, D. I.</creatorcontrib><creatorcontrib>Trukhina, M. A.</creatorcontrib><creatorcontrib>Fedosenko, Yu. S.</creatorcontrib><creatorcontrib>Sheyanov, A. V.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Automation and remote control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kogan, D. I.</au><au>Trukhina, M. A.</au><au>Fedosenko, Yu. S.</au><au>Sheyanov, A. V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Models and optimization problems for single-processor servicing of packets of objects</atitle><jtitle>Automation and remote control</jtitle><stitle>Autom Remote Control</stitle><date>2016-11-01</date><risdate>2016</risdate><volume>77</volume><issue>11</issue><spage>1994</spage><epage>2005</epage><pages>1994-2005</pages><issn>0005-1179</issn><eissn>1608-3032</eissn><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.</abstract><cop>Moscow</cop><pub>Pleiades Publishing</pub><doi>10.1134/S0005117916110096</doi><tpages>12</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0005-1179
ispartof	Automation and remote control, 2016-11, Vol.77 (11), p.1994-2005
issn	0005-1179 1608-3032
language	eng
recordid	cdi_proquest_miscellaneous_1893916506
source	Springer Link
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
title	Models and optimization problems for single-processor servicing of packets of objects
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T20%3A25%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Models%20and%20optimization%20problems%20for%20single-processor%20servicing%20of%20packets%20of%20objects&rft.jtitle=Automation%20and%20remote%20control&rft.au=Kogan,%20D.%20I.&rft.date=2016-11-01&rft.volume=77&rft.issue=11&rft.spage=1994&rft.epage=2005&rft.pages=1994-2005&rft.issn=0005-1179&rft.eissn=1608-3032&rft_id=info:doi/10.1134/S0005117916110096&rft_dat=%3Cproquest_cross%3E1893916506%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c301t-41911d30b726ae9e166bd3b61bdfb82c88f6355e17b958d7eb9b19dc4e047dcf3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1880842214&rft_id=info:pmid/&rfr_iscdi=true