使用可分配的到期日或可分配的权重进行单机抢先排程，以尽量减少加权延迟工作总量

IF 6 2区管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

European Journal of Operational Research Pub Date : 2024-11-13 DOI:10.1016/j.ejor.2024.11.010

Rubing Chen, Xinyu Dong, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng

{"title":"使用可分配的到期日或可分配的权重进行单机抢先排程，以尽量减少加权延迟工作总量","authors":"Rubing Chen, Xinyu Dong, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng","doi":"10.1016/j.ejor.2024.11.010","DOIUrl":null,"url":null,"abstract":"In this paper we study single-machine preemptive scheduling to minimize the total weighted late work with assignable due dates or assignable weights. For the problem with assignable due dates, we show that it is binary <mml:math altimg=\"si170.svg\" display=\"inline\"><mml:mrow><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:math>-hard, solvable in pseudo-polynomial time, and solvable in polynomial time when all the jobs have agreeable processing times and weights. For the problem with assignable weights, we show that it is solvable in polynomial time. For the problem with assignable due dates and assignable weights, we show that it is binary <mml:math altimg=\"si170.svg\" display=\"inline\"><mml:mrow><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:math>-hard, solvable in pseudo-polynomial time, and solvable in polynomial time when all the jobs have the same processing times.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"18 1","pages":""},"PeriodicalIF":6.0000,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work\",\"authors\":\"Rubing Chen, Xinyu Dong, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng\",\"doi\":\"10.1016/j.ejor.2024.11.010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study single-machine preemptive scheduling to minimize the total weighted late work with assignable due dates or assignable weights. For the problem with assignable due dates, we show that it is binary <mml:math altimg=\\\"si170.svg\\\" display=\\\"inline\\\"><mml:mrow><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:math>-hard, solvable in pseudo-polynomial time, and solvable in polynomial time when all the jobs have agreeable processing times and weights. For the problem with assignable weights, we show that it is solvable in polynomial time. For the problem with assignable due dates and assignable weights, we show that it is binary <mml:math altimg=\\\"si170.svg\\\" display=\\\"inline\\\"><mml:mrow><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:math>-hard, solvable in pseudo-polynomial time, and solvable in polynomial time when all the jobs have the same processing times.\",\"PeriodicalId\":55161,\"journal\":{\"name\":\"European Journal of Operational Research\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":6.0000,\"publicationDate\":\"2024-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1016/j.ejor.2024.11.010\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1016/j.ejor.2024.11.010","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们研究了单机抢占式调度，以最小化可分配截止日期或可分配权重的总加权延迟工作。对于可分配截止日期的问题，我们证明它是二元 NP 难问题，可在伪多项式时间内求解，当所有作业的处理时间和权重一致时，可在多项式时间内求解。对于权重可分配的问题，我们证明它可以在多项式时间内求解。对于可分配到期日和可分配权重的问题，我们证明它是二元 NP 难问题，可在伪多项式时间内求解，当所有作业的处理时间相同时，可在多项式时间内求解。

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

查看原文本刊更多论文

Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work

In this paper we study single-machine preemptive scheduling to minimize the total weighted late work with assignable due dates or assignable weights. For the problem with assignable due dates, we show that it is binary NP-hard, solvable in pseudo-polynomial time, and solvable in polynomial time when all the jobs have agreeable processing times and weights. For the problem with assignable weights, we show that it is solvable in polynomial time. For the problem with assignable due dates and assignable weights, we show that it is binary NP-hard, solvable in pseudo-polynomial time, and solvable in polynomial time when all the jobs have the same processing times.

求助全文

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

来源期刊

European Journal of Operational Research 管理科学-运筹学与管理科学

CiteScore

11.90

自引率

9.40%

发文量

786

审稿时长

8.2 months

期刊介绍： The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.