|
|
自动化学报 2005
基于约束理论的Flow-shop分解协调算法, PP. 182-187 Keywords: Flow-shopscheduling,TOC,bottleneck,decomposition,coordination Abstract: ？Therearemanyflowshopproblemsofthroughput(denotedbyFSPT)withconstraintsofduedateinrealproductionplanningandscheduling.Inthispaper,adecompositionandcoordinationalgorithmisproposedbasedontheanalysisofFSPTandunderthesupportofTOC(theoryofconstraint).AflowshopisatfirstdecomposedintotwosubsystemsnamedPULLandPUSHbymeansofbottleneck.Thenthesubsystemisdecomposedintosinglemachineschedulingproblems,sotheoriginalNP-HARDproblemcanbetransferredintoaserialofsinglemachineoptimizationproblemsfinally.Thismethodreducesthecomputationalcomplexity,andhasbeenusedinarealprojectsuccessfully.
|
