Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (34): 53-55.DOI: 10.3778/j.issn.1002-8331.2008.34.015

• 理论研究 • Previous Articles     Next Articles

No-Wait Flow Shop scheduling to minimize makespan

ZHONG Xue-ling   

  1. Department of Computer,Guangdong University of Finance,Guangzhou 510520,China
  • Received:2008-05-13 Revised:2008-09-01 Online:2008-12-01 Published:2008-12-01
  • Contact: ZHONG Xue-ling

极小化时间表长的无等待流水车间调度

钟雪灵   

  1. 广东金融学院 计算机系,广州 510520
  • 通讯作者: 钟雪灵

Abstract: In this paper,a Hybrid Taboo Search(HTS) algorithm is proposed for the No-Wait Flow Shop(NWFS) problem with makespan criterion.An initial solution is obtained by the heuristic algorithm and improved by the Taboo Search(TS) algorithm.Experiment results on a large number of the random generated instances show that HTS outperforms three classical algorithms RAJ,VNS and GASA,therefore the proposed algorithm is effective in finding optimal or near-optimal solutions.

Key words: No-Wait Flow Shop(NWFS), makespan, heuristic algorithm, Hybrid Taboo Search(HTS)

摘要: 针对以时间表长最小为目标函数的无等待流水车间(No-Wait Flow Shop,NWFS)调度问题,提出了一个混合禁忌搜索算法(Hybrid Taboo Search,HTS),以启发式算法产生的解作为初始解,通过禁忌搜索进一步提高解的质量。大量随机产生实例的实验结果表明:提出的HTS算法在总体性能上优于经典的RAJ、VNS和GASA算法,因此该算法具有可行性和优越性。

关键词: 无等待流水车间调度, 时间表长, 启发式算法, 混合禁忌搜索