【作者】 张纪会； 徐军芹； 张绍兰；

【Author】 Zhang Jihui, Xu Junqin, Zhang Shaolan(Institute of Complexity Science, Qingdao University, Qingdao 266071, China;Department of Mathematics, Qingdao University, Qingdao 266071, China;Department of Computer Science, Shandong Institute of Architecture &Engineering, Jinan 250014, China)

【机构】 青岛大学复杂性科学研究所； 青岛大学数学系； 山东建筑工程学院计算机系；

【摘要】 Job-shop调度问题是一典型的组合优化难题,至今尚无有效的求解方法。提出了一种用于求解Job-shop调度问题的宏观进化算法,对解的表示、殖民化算子、算法流程等问题进行了研究,并用Fisher和Thompson的6×6及10×10调度问题进行测试,大量仿真实验结果表明,本文提出的算法是行之有效的。更多还原

【Abstract】 Job-shop scheduling is a classical combinatorial hard problem and there is no efficient solution method yet. Usually it is solved by some kind of heuristics to determine it machining sequence and starting time. A co-macroevolutionary algorithm for it. Solution representation, colonization operator as well as algorithm procedure are discussed in detail. Some benchmark problems are used to test its validity.更多还原