摘要
并行Flowshop调度问题兼有并行机器和流程车间调度问题的特点,是一类新型的调度问题.针对最小化最大完工时间目标函数,建立了一般并行Flowshop调度问题的整数规划模型.鉴于问题的求解复杂性,设计了基于概率学习的求解算法.对随机生成的测试问题进行求解,实验结果显示出该算法求解并行Flowshop调度问题的良好潜能.
The parallel flow shop scheduling problem is a new kind of scheduling problem,which possesses the characteristics of both the parallel machines scheduling and the flow shop scheduling.A general parallel flow shop problem with the objective of minimizing makespan is addressed,and a mixed integer programming model is given.In view of the intractable nature of the problem,a probability learning based evolutionary algorithm is proposed to solve the problem.This algorithm is tested on some randomly generated problems.Computational results show that the proposed approach is accurate and effective.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
2005年第1期149-152,共4页
Control Theory & Applications
基金
辽宁省科技基金项目(200112020).
关键词
并行流程车间
调度
概率学习
进化算法
parallel flow shop
scheduling
probability learning
evolutionary algorithm
