{"title":"单机延迟最小化的研究","authors":"Bochra Djahel, I. Kacem, Giorgio Lucarelli","doi":"10.1109/ICNSC52481.2021.9702231","DOIUrl":null,"url":null,"abstract":"In this paper, we describe a Branch-and-Bound (B&B) approach for the problem of minimizing the total tardiness of a set of jobs on a single machine. This is an important objective in several applications where a payment is required in the case of delayed jobs. A new lower bound has been introduced based on several heuristics for the problem. An experimental campaign has been performed showing that our approach can handle up to 20 jobs in a reasonable time.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Tardiness Minimization on Single Machine\",\"authors\":\"Bochra Djahel, I. Kacem, Giorgio Lucarelli\",\"doi\":\"10.1109/ICNSC52481.2021.9702231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we describe a Branch-and-Bound (B&B) approach for the problem of minimizing the total tardiness of a set of jobs on a single machine. This is an important objective in several applications where a payment is required in the case of delayed jobs. A new lower bound has been introduced based on several heuristics for the problem. An experimental campaign has been performed showing that our approach can handle up to 20 jobs in a reasonable time.\",\"PeriodicalId\":129062,\"journal\":{\"name\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC52481.2021.9702231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we describe a Branch-and-Bound (B&B) approach for the problem of minimizing the total tardiness of a set of jobs on a single machine. This is an important objective in several applications where a payment is required in the case of delayed jobs. A new lower bound has been introduced based on several heuristics for the problem. An experimental campaign has been performed showing that our approach can handle up to 20 jobs in a reasonable time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
