摘要
提出了一种解决车间作业调度最短完成时间的有效的混合算法.基于考虑到遗传算法的早熟收敛问题和禁忌搜索算法的自适应优点,该算法结合了遗传算法和禁忌搜索算法对Job-Shop车间作业调度问题的解进行编码,通过实例表明该算法是可行和有效的.
An effective mixed algorithm for solving the minimun makespan problem of job-shop scheduling is presented. Aiming at a class of job shop scheduling problem with routing flexibility, an optimal scheduling algorithm that combines GA（ Genetic Algorithm）with TS（Taboo Search） is established. Simulation results demonstrate that the mixed algorithm is applicable and effective.
出处
《大连交通大学学报》
CAS
2009年第4期64-66,共3页
Journal of Dalian Jiaotong University
作者简介
时维国（1973-），男，副教授，硕士，主要从事CIMS、智能调度算法、先进控制技术方面的研究E-mail：swg@djtu．edu．cn．
