优化集团激励计划

IF 0.6 4区 计算机科学 Q4 AUTOMATION & CONTROL SYSTEMS
V. N. Burkov, I. V. Burkova, A. R. Kashenkov
{"title":"优化集团激励计划","authors":"V. N. Burkov, I. V. Burkova, A. R. Kashenkov","doi":"10.1134/s0005117923120020","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper considers the problem of motivating the reduction of project duration. The duration cuts of project works and the corresponding costs are given. A group incentive scheme is used to compensate for the costs. In this scheme, all works are partitioned into groups and a unified incentive scheme is applied for each group. Two types of unified incentive schemes are studied for groups, namely, linear and jump ones. The problem is to partition all project works into groups and choose an appropriate incentive scheme for each group by minimizing the total incentive fund. Solution algorithms are proposed based on determining the shortest path in the network. Special cases are also analyzed (partition with the minimum number of groups and partition with the maximum number of groups).</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization of Group Incentive Schemes\",\"authors\":\"V. N. Burkov, I. V. Burkova, A. R. Kashenkov\",\"doi\":\"10.1134/s0005117923120020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p>This paper considers the problem of motivating the reduction of project duration. The duration cuts of project works and the corresponding costs are given. A group incentive scheme is used to compensate for the costs. In this scheme, all works are partitioned into groups and a unified incentive scheme is applied for each group. Two types of unified incentive schemes are studied for groups, namely, linear and jump ones. The problem is to partition all project works into groups and choose an appropriate incentive scheme for each group by minimizing the total incentive fund. Solution algorithms are proposed based on determining the shortest path in the network. Special cases are also analyzed (partition with the minimum number of groups and partition with the maximum number of groups).</p>\",\"PeriodicalId\":55411,\"journal\":{\"name\":\"Automation and Remote Control\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automation and Remote Control\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1134/s0005117923120020\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automation and Remote Control","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0005117923120020","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

摘要 本文探讨了缩短项目工期的激励问题。文中给出了项目工程的工期削减和相应的成本。采用分组激励计划来补偿成本。在该方案中,所有工程都被划分为若干组,每组都有一个统一的激励方案。我们研究了两种针对小组的统一激励方案,即线性激励方案和跳跃式激励方案。问题是将所有项目工程划分为若干组,并通过最小化总激励基金为每组选择合适的激励方案。在确定网络中最短路径的基础上,提出了求解算法。此外,还分析了特殊情况(最小组数分区和最大组数分区)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of Group Incentive Schemes

Abstract

This paper considers the problem of motivating the reduction of project duration. The duration cuts of project works and the corresponding costs are given. A group incentive scheme is used to compensate for the costs. In this scheme, all works are partitioned into groups and a unified incentive scheme is applied for each group. Two types of unified incentive schemes are studied for groups, namely, linear and jump ones. The problem is to partition all project works into groups and choose an appropriate incentive scheme for each group by minimizing the total incentive fund. Solution algorithms are proposed based on determining the shortest path in the network. Special cases are also analyzed (partition with the minimum number of groups and partition with the maximum number of groups).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Automation and Remote Control
Automation and Remote Control 工程技术-仪器仪表
CiteScore
1.70
自引率
28.60%
发文量
90
审稿时长
3-8 weeks
期刊介绍: Automation and Remote Control is one of the first journals on control theory. The scope of the journal is control theory problems and applications. The journal publishes reviews, original articles, and short communications (deterministic, stochastic, adaptive, and robust formulations) and its applications (computer control, components and instruments, process control, social and economy control, etc.).
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信