| An Tentative Taboo Search Algorithm for Job Shop Scheduling |
| |
| 引用本文： | HUANG Wenqi HUANG Zhi WANG Lei. An Tentative Taboo Search Algorithm for Job Shop Scheduling[J]. 武汉大学学报:自然科学英文版, 2006, 11(3): 547-550. DOI: 10.1007/BF02836662 |
| |
| 作者姓名： | HUANG Wenqi HUANG Zhi WANG Lei |
| |
| 作者单位： | College of Computer Science and Technology, Huazhong University of Scienee and Technology, Wuhan 430074,Hubei, China |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划) |
| |
| 摘 要： | 0 IntroductionThmeo juosb sschhoepduslcinhged uplrionbgl epmrosbl wehmic(hJS aSrPe) oifs oconem obfi ntahteorfiaa-lopti mization and which have proved to be NP-hard[1]. ForJSSP, Many heuristic procedures has been developed,such asprocedures based on dispatching rules for choosing the nextjobto be“dispatched”,Shifting Bottleneck Procedures basedon repeatedly opti mizing the sequence on each individual ma-chine[2],local search procedures which use neighborhood de-fined by reversing some s…
|
| 关 键 词： | 启发式算法 作业安排调度 禁忌搜索 试验性 |
| 文章编号： | 1007-1202（2006）03-0547-04 |
| 收稿时间： | 2005-06-20 |
An tentative taboo search algorithm for job shop scheduling |
| |
| Huang Wenqi,Huang Zhi,Wang Lei. An tentative taboo search algorithm for job shop scheduling[J]. Wuhan University Journal of Natural Sciences, 2006, 11(3): 547-550. DOI: 10.1007/BF02836662 |
| |
| Authors: | Huang Wenqi Huang Zhi Wang Lei |
| |
| Affiliation: | (1) College of Computer Science and Technology, Huazhong University of Science and Technology, 430074 Wuhan Hubei, China |
| |
| Abstract: | An effective heuristic algorithm for solving the minimum makespan problem of job shop scheduling is presented. With a given feasible solution as a start point, we use Taboo Search technique to get a schedule for each neighbor of all its neighbors, and select the best one of the schedules as the new start point. We repeat the procedure, unless the new start point is not better than the proceeding one. To make sure of better results, we introduce reverse technique to the algorithm as well. The computational experiments of the 45 standard instances show that our algorithm yields better results than TSAB algorithm. |
| |
| Keywords: | heuristics job shop scheduling Taboo search tentative reverse |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
