{"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}
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.