时间资源调度公平性

Madeline Little, Aspen Olmsted
{"title":"时间资源调度公平性","authors":"Madeline Little, Aspen Olmsted","doi":"10.1109/ICITST.2016.7856716","DOIUrl":null,"url":null,"abstract":"This paper examines the process used in scheduling limited resources for blocks of time. The paper compares a complex algorithm current used to a random assignment system on scheduling equity. This research involved scheduling contracted guides with non-regular schedules to tours in advance or the day of the scheduling process. The random assignment algorithm, which is analyzed by equity, replaces a more complex algorithm that includes a ratio to prioritize guide assignment. Data from the Gettysburg Foundation was used to compare equity between the two assignment algorithms.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Temporal resource scheduling equity\",\"authors\":\"Madeline Little, Aspen Olmsted\",\"doi\":\"10.1109/ICITST.2016.7856716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper examines the process used in scheduling limited resources for blocks of time. The paper compares a complex algorithm current used to a random assignment system on scheduling equity. This research involved scheduling contracted guides with non-regular schedules to tours in advance or the day of the scheduling process. The random assignment algorithm, which is analyzed by equity, replaces a more complex algorithm that includes a ratio to prioritize guide assignment. Data from the Gettysburg Foundation was used to compare equity between the two assignment algorithms.\",\"PeriodicalId\":258740,\"journal\":{\"name\":\"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITST.2016.7856716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITST.2016.7856716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了在调度有限资源的时间块中使用的过程。本文将一种复杂的调度公平性算法与随机分配系统进行了比较。这项研究涉及安排合同导游不定期安排旅游提前或当天的安排过程。随机分配算法,用公平分析,取代了一个更复杂的算法,其中包括一个比例优先级指导分配。来自葛底斯堡基金会的数据被用来比较两种分配算法之间的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Temporal resource scheduling equity
This paper examines the process used in scheduling limited resources for blocks of time. The paper compares a complex algorithm current used to a random assignment system on scheduling equity. This research involved scheduling contracted guides with non-regular schedules to tours in advance or the day of the scheduling process. The random assignment algorithm, which is analyzed by equity, replaces a more complex algorithm that includes a ratio to prioritize guide assignment. Data from the Gettysburg Foundation was used to compare equity between the two assignment algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信