考虑原负载等待约束的带释放时间的最小等待时间重调度

Q2 Computer Science

自动化学报 Pub Date : 2014-03-28 DOI:10.3724/SP.J.1004.2013.02100

Yan-Dong Guo, Wang Qing, Huang Min

{"title":"考虑原负载等待约束的带释放时间的最小等待时间重调度","authors":"Yan-Dong Guo, Wang Qing, Huang Min","doi":"10.3724/SP.J.1004.2013.02100","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the rescheduling problem to minimize the sum of waiting times of rework jobs and the original loads with release time on a single machine, and the waiting time of each original load is constrained by a value. The problem of rescheduling for reworks on a single machine (RRSM) is formulated and proved to be NP-hard. A dynamic insert heuristic (DIH) algorithm of polynomial-time is designed and proved with three properties. With respect to two special cases of the identical processing time of rework jobs or the machine without idle times in the original schedule, the DIH algorithm can obtain an optimal solution. A discrimination condition is proved for the optimal solution and efiectiveness of the DIH algorithm is explained by cases with regard to general RRSM problems.","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads\",\"authors\":\"Yan-Dong Guo, Wang Qing, Huang Min\",\"doi\":\"10.3724/SP.J.1004.2013.02100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the rescheduling problem to minimize the sum of waiting times of rework jobs and the original loads with release time on a single machine, and the waiting time of each original load is constrained by a value. The problem of rescheduling for reworks on a single machine (RRSM) is formulated and proved to be NP-hard. A dynamic insert heuristic (DIH) algorithm of polynomial-time is designed and proved with three properties. With respect to two special cases of the identical processing time of rework jobs or the machine without idle times in the original schedule, the DIH algorithm can obtain an optimal solution. A discrimination condition is proved for the optimal solution and efiectiveness of the DIH algorithm is explained by cases with regard to general RRSM problems.\",\"PeriodicalId\":35798,\"journal\":{\"name\":\"自动化学报\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"自动化学报\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.3724/SP.J.1004.2013.02100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"自动化学报","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.3724/SP.J.1004.2013.02100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 9

摘要

本文考虑重调度问题，以最小化单机上的返工作业与具有释放时间的原始负载的等待时间总和，并且每个原始负载的等待时间都有一个值约束。提出了单机返工的重调度问题，并证明了该问题具有np困难。设计了一种多项式时间的动态插入启发式(DIH)算法，并证明了它具有三个性质。对于返工作业加工时间相同或原计划中机器无空闲时间的两种特殊情况，DIH算法可以得到最优解。对于一般的RRSM问题，证明了最优解的判别条件，并通过实例说明了DIH算法的有效性。

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

查看原文本刊更多论文

Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads

In this paper, we consider the rescheduling problem to minimize the sum of waiting times of rework jobs and the original loads with release time on a single machine, and the waiting time of each original load is constrained by a value. The problem of rescheduling for reworks on a single machine (RRSM) is formulated and proved to be NP-hard. A dynamic insert heuristic (DIH) algorithm of polynomial-time is designed and proved with three properties. With respect to two special cases of the identical processing time of rework jobs or the machine without idle times in the original schedule, the DIH algorithm can obtain an optimal solution. A discrimination condition is proved for the optimal solution and efiectiveness of the DIH algorithm is explained by cases with regard to general RRSM problems.

求助全文

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

来源期刊

自动化学报 Computer Science-Computer Graphics and Computer-Aided Design

CiteScore

4.80

自引率

0.00%

发文量

6655

期刊介绍： ACTA AUTOMATICA SINICA is a joint publication of Chinese Association of Automation and the Institute of Automation, the Chinese Academy of Sciences. The objective is the high quality and rapid publication of the articles, with a strong focus on new trends, original theoretical and experimental research and developments, emerging technology, and industrial standards in automation.