{"title":"使用权重修正活动进行排程，以尽量减少总加权完成时间","authors":"Bertrand M.T. Lin , Shu-Wei Liu , Gur Mosheiov","doi":"10.1016/j.omega.2024.103115","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers a single-machine scheduling problem to minimize the total weighted completion time with a weight modifying activity, after which the job weights are discounted by a given factor. The problem is known to be ordinary NP-hard. We propose two mixed integer linear programs (MILPs) and a dynamic programming algorithm to optimally solve the problem. Optimality properties are established and then formulated as pruning constraints to improve the problem-solving efficiency of the MILPs. Special cases are discussed and shown to be solvable by polynomial time algorithms. Complexity status of the studied problem with several instance characteristics is shown. Computational experiments indicate that the optimality properties can reduce the computing efforts and that one of the proposed MILPs can solve instances of 200 jobs in a few seconds.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":null,"pages":null},"PeriodicalIF":6.7000,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling with a weight-modifying activity to minimize the total weighted completion time\",\"authors\":\"Bertrand M.T. Lin , Shu-Wei Liu , Gur Mosheiov\",\"doi\":\"10.1016/j.omega.2024.103115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper considers a single-machine scheduling problem to minimize the total weighted completion time with a weight modifying activity, after which the job weights are discounted by a given factor. The problem is known to be ordinary NP-hard. We propose two mixed integer linear programs (MILPs) and a dynamic programming algorithm to optimally solve the problem. Optimality properties are established and then formulated as pruning constraints to improve the problem-solving efficiency of the MILPs. Special cases are discussed and shown to be solvable by polynomial time algorithms. Complexity status of the studied problem with several instance characteristics is shown. Computational experiments indicate that the optimality properties can reduce the computing efforts and that one of the proposed MILPs can solve instances of 200 jobs in a few seconds.</p></div>\",\"PeriodicalId\":19529,\"journal\":{\"name\":\"Omega-international Journal of Management Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Omega-international Journal of Management Science\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305048324000811\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Omega-international Journal of Management Science","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305048324000811","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
Scheduling with a weight-modifying activity to minimize the total weighted completion time
This paper considers a single-machine scheduling problem to minimize the total weighted completion time with a weight modifying activity, after which the job weights are discounted by a given factor. The problem is known to be ordinary NP-hard. We propose two mixed integer linear programs (MILPs) and a dynamic programming algorithm to optimally solve the problem. Optimality properties are established and then formulated as pruning constraints to improve the problem-solving efficiency of the MILPs. Special cases are discussed and shown to be solvable by polynomial time algorithms. Complexity status of the studied problem with several instance characteristics is shown. Computational experiments indicate that the optimality properties can reduce the computing efforts and that one of the proposed MILPs can solve instances of 200 jobs in a few seconds.
期刊介绍：
Omega reports on developments in management, including the latest research results and applications. Original contributions and review articles describe the state of the art in specific fields or functions of management, while there are shorter critical assessments of particular management techniques. Other features of the journal are the "Memoranda" section for short communications and "Feedback", a correspondence column. Omega is both stimulating reading and an important source for practising managers, specialists in management services, operational research workers and management scientists, management consultants, academics, students and research personnel throughout the world. The material published is of high quality and relevance, written in a manner which makes it accessible to all of this wide-ranging readership. Preference will be given to papers with implications to the practice of management. Submissions of purely theoretical papers are discouraged. The review of material for publication in the journal reflects this aim.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
