摘要
讨论并行多机成组工件的极小化最大通过时间调度问题·它是一个非常复杂的组合优化问题 ,是NP难题·为了解决此类问题 ,采用了两种智能优化算法方法·通过大量的仿真实验 ,将两种方法进行了比较·结果证明 :禁忌搜索结合启发式的智能优化算法可靠性高、运算速度快 ,有能力有效地解决大规模实际问题·
A job scheduling model of identical machines on parallel was addressed. The model assumes that a setup time is incurred when a machine changes from processing one type of parts to a different type of parts, and the scheduling objective is to minimize the sum of total flow time. This kind of problem is NP hard. Two optimal algorithm methods were esablished. The solution was analyzed by computational study. The comparisons of the solutions show that the Tabu Search combined with heuristic algorithm is more reliable and has abilities to solve larger scale practical problems.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2001年第2期188-191,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目! (6 0 0 840 0 3)
西安交通大学机械制造系统工程国家重点实验室资助项目
