自动化学报2005，Vol.31Issue(2)：182-187,6.
基于约束理论的Flow-shop分解协调算法
A Decomposition and Coordination Scheduling Method for Flow-shop Problem Based on TOC
摘要
Abstract
There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems,so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.关键词
Flow-shop scheduling/TOC/bottleneck/decomposition/coordinationKey words
Flow-shop scheduling/TOC/bottleneck/decomposition/coordination分类
信息技术与安全科学引用本文复制引用
张宏远,席裕庚,谷寒雨..基于约束理论的Flow-shop分解协调算法[J].自动化学报,2005,31(2):182-187,6.基金项目
Supported by National Natural Science Foundation of P. R. China (60274013) （60274013）
