2.765

2022影响因子

(CJCR)

  • 中文核心
  • EI
  • 中国科技核心
  • Scopus
  • CSCD
  • 英国科学文摘

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

基于约束理论的Flow-shop分解协调算法

张宏远 席裕庚 谷寒雨

张宏远, 席裕庚, 谷寒雨. 基于约束理论的Flow-shop分解协调算法. 自动化学报, 2005, 31(2): 182-187.
引用本文: 张宏远, 席裕庚, 谷寒雨. 基于约束理论的Flow-shop分解协调算法. 自动化学报, 2005, 31(2): 182-187.
ZHANG Hong-Yuan, XI Yu-Geng, GU Han-Yu. A Decomposition and Coordination Scheduling Method for Flow-shop Problem Based on TOC. ACTA AUTOMATICA SINICA, 2005, 31(2): 182-187.
Citation: ZHANG Hong-Yuan, XI Yu-Geng, GU Han-Yu. A Decomposition and Coordination Scheduling Method for Flow-shop Problem Based on TOC. ACTA AUTOMATICA SINICA, 2005, 31(2): 182-187.

基于约束理论的Flow-shop分解协调算法

详细信息
    通讯作者:

    张宏远

A Decomposition and Coordination Scheduling Method for Flow-shop Problem Based on TOC

More Information
    Corresponding author: ZHANG Hong-Yuan
  • 摘要: 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.
  • 加载中
计量
  • 文章访问数:  2246
  • HTML全文浏览量:  52
  • PDF下载量:  1563
  • 被引次数: 0
出版历程
  • 收稿日期:  2003-11-26
  • 修回日期:  2004-05-20
  • 刊出日期:  2005-03-20

目录

    /

    返回文章
    返回