摘要
并行生产线调度问题兼有并行机器和流程车间调度问题的特点 ,是一类新型的调度问题·针对工件在各工序具有任意加工时间的一般并行生产线调度问题 ,构造了整数规划模型 。
Parallel flow-lines scheduling is a new kind of scheduling. The parallel scheduling has the characters of the parallel machines and the flow shop scheduling. A general parallel flow lines problem with the objective of minimizing makespan was considered, and a mixed integer programming model is given. In view of the intractable nature of the problem, a probability learning based evolutionary algorithm was proposed to solve the problem. The algorithm was tested on some randomly generated problems.
出处
《东北大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2003年第4期338-341,共4页
Journal of Northeastern University(Natural Science)
基金
辽宁省博士启动基金资助项目 (2 0 0 112 0 2 0 )
关键词
并行生产线调度
最大完工时间
概率分析算法
parallel flow lines scheduling
probability learning
evolutionary algorithm