%0 Journal Article
%T 基于约束理论的Flow-shop分解协调算法
%A 张宏远
%A 席裕庚
%A 谷寒雨
%J 自动化学报
%P 182-187
%D 2005
%X ？Therearemanyflowshopproblemsofthroughput(denotedbyFSPT)withconstraintsofduedateinrealproductionplanningandscheduling.Inthispaper,adecompositionandcoordinationalgorithmisproposedbasedontheanalysisofFSPTandunderthesupportofTOC(theoryofconstraint).AflowshopisatfirstdecomposedintotwosubsystemsnamedPULLandPUSHbymeansofbottleneck.Thenthesubsystemisdecomposedintosinglemachineschedulingproblems,sotheoriginalNP-HARDproblemcanbetransferredintoaserialofsinglemachineoptimizationproblemsfinally.Thismethodreducesthecomputationalcomplexity,andhasbeenusedinarealprojectsuccessfully.
%K Flow-shopscheduling
%K TOC
%K bottleneck
%K decomposition
%K coordination
%U http://www.aas.net.cn/CN/abstract/abstract15828.shtml