摘要
首次研究了3阶段柔性流水作业问题,其中阶段1由m1台同型机组成,阶段2为一台批处理机,而阶段3由m2台同型机组成.以Cmax为极小化目标函数,对其中各阶段机器加工时间服从ddm和idm的所有情况给出了启发式算法及其性能比分析.
This paper first study three stages flexible flow shop scheduling problems： with m, identical parallel machines in stage one, a batch processor in stage two, and m2 identical parallel machines in stage three. The objective is to minimize Cmax. For this, heuristics are given and their worst-case performance ratios estimated corresponding to the cases in which the jobs＇ processing times in the three stages obey the ddm rule （ idm rule）.
出处
《上海大学学报（自然科学版）》
CAS
CSCD
北大核心
2006年第6期581-587,共7页
Journal of Shanghai University:Natural Science Edition
基金
上海市高教局数学模型课程建设资助项目
关键词
排序
柔性流水作业
同型机
批处理机
近似算法
性能比
scheduling
flexible flow shop
identical machines
batch processor
approximate algorithms
worst-case performance ratio
