摘要
对于n个工件m台设备的作业调度问题,分析了基于作业工序编码算法存在的不足,提出了基于工作中心编码的遗传算法,即在不同染色体相同工作中心之间进行作业交换,有效扩大搜索解的空间。实验表明,基于工作中心编码算法的调度效果和调度效率均优于基于工序编码的算法。
For solving job shop scheduling problem with n work pieces and m equipments, the shortage of the algorithm is analyzed based on the working procedure, and another algorithm is proposed based on work centers. That is, between the different chromosomes, jobs on the same working center are exchanged, so that the search space of solution is effectively expanded. Experiments show that the algorithm based on the work center is more efficiency than scheduling algorithm based on the working procedure.
出处
《南通职业大学学报》
2009年第4期66-69,共4页
Journal of Nantong Vocational University
基金
南通职业大学自然科学基金(0706113)
关键词
企业资源规划
车间作业调度
高级计划与排程
enterprise resource planning
job shop scheduling problem
advanced planning and scheduling