均衡分配定期任务

arXiv - CS - Discrete Mathematics Pub Date : 2024-07-07 DOI:arxiv-2407.05485

Héloïse Gachet, Frédéric Meunier

{"title":"均衡分配定期任务","authors":"Héloïse Gachet, Frédéric Meunier","doi":"arxiv-2407.05485","DOIUrl":null,"url":null,"abstract":"This work deals with a problem of assigning periodic tasks to employees in\nsuch a way that each employee performs each task with the same frequency in the\nlong term. The motivation comes from a collaboration with the SNCF, the main\nFrench railway company. An almost complete solution is provided under the form\nof a necessary and sufficient condition that can be checked in polynomial time.\nA complementary discussion about possible extensions is also proposed.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"46 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Balanced assignments of periodic tasks\",\"authors\":\"Héloïse Gachet, Frédéric Meunier\",\"doi\":\"arxiv-2407.05485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work deals with a problem of assigning periodic tasks to employees in\\nsuch a way that each employee performs each task with the same frequency in the\\nlong term. The motivation comes from a collaboration with the SNCF, the main\\nFrench railway company. An almost complete solution is provided under the form\\nof a necessary and sufficient condition that can be checked in polynomial time.\\nA complementary discussion about possible extensions is also proposed.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"46 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.05485\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.05485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

这项工作涉及的问题是如何为员工分配定期任务，以使每位员工在长期内以相同的频率完成每项任务。其动机来自与法国主要铁路公司 SNCF 的合作。在必要条件和充分条件的形式下，提供了一个几乎完整的解决方案，可以在多项式时间内检查。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Balanced assignments of periodic tasks

This work deals with a problem of assigning periodic tasks to employees in such a way that each employee performs each task with the same frequency in the long term. The motivation comes from a collaboration with the SNCF, the main French railway company. An almost complete solution is provided under the form of a necessary and sufficient condition that can be checked in polynomial time. A complementary discussion about possible extensions is also proposed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Discrete Mathematics

自引率

0.00%

发文量