安排一个无等待的流水作业，将安装和移除时间分开

Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788) Pub Date : 2004-06-15 DOI:10.1109/WCICA.2004.1343040

Jun-lin Chang, Zhengjun Xing, Hui-he Shao, Bingzhen Pei

{"title":"安排一个无等待的流水作业，将安装和移除时间分开","authors":"Jun-lin Chang, Zhengjun Xing, Hui-he Shao, Bingzhen Pei","doi":"10.1109/WCICA.2004.1343040","DOIUrl":null,"url":null,"abstract":"Consider the two-machine no-wait flowshop problem where the setup and removal times of a job at each machine are separated from the processing time. The scheduling objective is to minimize the sum of the total flowtime. Two optimization properties are first developed. In view of the NP-hard of this problem, optimal solutions seem unnecessary especially when the number of jobs is large. Then, combined the developed optimization properties with the greedy search a heuristic algorithm is developed. Computational experience demonstrates the effectiveness of the heuristic algorithm in finding near optimal schedules.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scheduling a no-wait flowshop with separated setup and removal times\",\"authors\":\"Jun-lin Chang, Zhengjun Xing, Hui-he Shao, Bingzhen Pei\",\"doi\":\"10.1109/WCICA.2004.1343040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consider the two-machine no-wait flowshop problem where the setup and removal times of a job at each machine are separated from the processing time. The scheduling objective is to minimize the sum of the total flowtime. Two optimization properties are first developed. In view of the NP-hard of this problem, optimal solutions seem unnecessary especially when the number of jobs is large. Then, combined the developed optimization properties with the greedy search a heuristic algorithm is developed. Computational experience demonstrates the effectiveness of the heuristic algorithm in finding near optimal schedules.\",\"PeriodicalId\":331407,\"journal\":{\"name\":\"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2004.1343040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2004.1343040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

考虑两台机器无等待流水车间问题，其中每台机器上作业的设置和删除时间与处理时间是分开的。调度目标是使总流程时间的总和最小。首先提出了两个优化性质。考虑到该问题的NP-hard，特别是当作业数量较大时，最优解似乎是不必要的。然后，将所研究的优化特性与贪婪搜索相结合，提出了一种启发式算法。计算经验证明了启发式算法在寻找近最优调度方面的有效性。

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

查看原文本刊更多论文

Scheduling a no-wait flowshop with separated setup and removal times

Consider the two-machine no-wait flowshop problem where the setup and removal times of a job at each machine are separated from the processing time. The scheduling objective is to minimize the sum of the total flowtime. Two optimization properties are first developed. In view of the NP-hard of this problem, optimal solutions seem unnecessary especially when the number of jobs is large. Then, combined the developed optimization properties with the greedy search a heuristic algorithm is developed. Computational experience demonstrates the effectiveness of the heuristic algorithm in finding near optimal schedules.

求助全文

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

来源期刊

Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)

自引率

0.00%

发文量