摘要
本文研究一类特殊的Job-Shop问题——广义Flow-Shop问题。首先给出了“广义Flow-Shop”的定义,然后提出了一种求解这类问题的启发式算法——逐机排序法。理论上和仿真中证明,用该方法求解广义Flow-Shop问题与一般Job-shop启发式算法等价,但计算大为简化和省时。
In this paper, we investigate a special kind of Job-Shop problems ——generalized Flow-Shop problems. First, we give the definition of generalized Flow-Shop problems. Then, we present a new heuristic method. for solving this kind of problems——“sequencing the operations machine by machine”. It is proved that the new method is much simpler than traditional methods used in solving Job-Shop problems and get the same result.
出处
《控制与决策》
EI
CSCD
北大核心
1992年第5期355-360,共6页
Control and Decision
