加工时间可控的双机流水车间禁忌搜索算法

2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES) Pub Date : 2014-12-01 DOI:10.1109/CIES.2014.7011832

Kailiang Xu, Gang Zheng, Sha Liu

{"title":"加工时间可控的双机流水车间禁忌搜索算法","authors":"Kailiang Xu, Gang Zheng, Sha Liu","doi":"10.1109/CIES.2014.7011832","DOIUrl":null,"url":null,"abstract":"This paper concerns on a two-machine flow-shop scheduling problem with controllable processing times modeled by a non-linear convex resource consumption function. The objective is to minimize the resource consumption that is needed to control the makespan not to exceed the given deadline. A tabu-search algorithm is designed, which searches for the optimal or near optimal job-processing sequence, while the processing times of the operations are determined by an optimal resource allocation algorithm thereafter. Numerical experiment shows the tabu-search algorithm is able to provide optimal or near-optimal solutions for medium or large-scaled problems.","PeriodicalId":287779,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A tabu-search algorithm for two-machine flow-shop with controllable processing times\",\"authors\":\"Kailiang Xu, Gang Zheng, Sha Liu\",\"doi\":\"10.1109/CIES.2014.7011832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper concerns on a two-machine flow-shop scheduling problem with controllable processing times modeled by a non-linear convex resource consumption function. The objective is to minimize the resource consumption that is needed to control the makespan not to exceed the given deadline. A tabu-search algorithm is designed, which searches for the optimal or near optimal job-processing sequence, while the processing times of the operations are determined by an optimal resource allocation algorithm thereafter. Numerical experiment shows the tabu-search algorithm is able to provide optimal or near-optimal solutions for medium or large-scaled problems.\",\"PeriodicalId\":287779,\"journal\":{\"name\":\"2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIES.2014.7011832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIES.2014.7011832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

研究了一类加工时间可控的双机流水车间调度问题，该问题用非线性凸资源消耗函数建模。目标是最小化控制完工时间不超过给定期限所需的资源消耗。设计了一种禁忌搜索算法，搜索最优或接近最优的作业处理序列，然后通过最优资源分配算法确定作业的处理时间。数值实验表明，禁忌搜索算法能够为大中型问题提供最优或近最优解。

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

查看原文本刊更多论文

A tabu-search algorithm for two-machine flow-shop with controllable processing times

This paper concerns on a two-machine flow-shop scheduling problem with controllable processing times modeled by a non-linear convex resource consumption function. The objective is to minimize the resource consumption that is needed to control the makespan not to exceed the given deadline. A tabu-search algorithm is designed, which searches for the optimal or near optimal job-processing sequence, while the processing times of the operations are determined by an optimal resource allocation algorithm thereafter. Numerical experiment shows the tabu-search algorithm is able to provide optimal or near-optimal solutions for medium or large-scaled problems.

求助全文

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

来源期刊

2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)

自引率

0.00%

发文量