Upper bound estimate for the minimal buffer of flow-shop systems

被引：0
|
作者：
Yang, Chengwu [1 ]
Niu, Yugang [1 ]
Zou, Yun [1 ]
机构：
[1] Nanjing Univ of Science and, Technology, Nanjing, China
来源：
Zidonghua Xuebao/Acta Automatica Sinica | 1993年 / 19卷 / 06期
关键词：
Flexible manufacturing systems - Machine shop practice - Mathematical techniques - Production control - Production engineering - Productivity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
For flow-shop systems of type 2×n and type m×n, an estimation of upper bound of minimal buffer capacity was given for each machine so that the bottleneck machine can be utilized sufficiently. This result provides theoretical basis for increasing the productivity of flow-shop systems as well as for optimizing the system design.
引用
收藏
页码：732 / 735
相关论文
共 50 条
  • [1] BRANCH AND BOUND ALGORITHM FOR THE FLOW-SHOP WITH MULTIPLE PROCESSORS
    BRAH, SA
    HUNSUCKER, JL
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (01) : 88 - 99
  • [2] FLOW-SHOP SCHEDULING WITH BRANCH-AND-BOUND METHOD
    MCMAHON, GB
    BURTON, PG
    OPERATIONS RESEARCH, 1967, 15 (03) : 473 - &
  • [3] A way for flow-shop scheduling when time buffer is considered
    Cai, YB
    Li, BQ
    PROCEEDINGS OF '97 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, 1997, : 324 - 328
  • [4] Optimisation of flow-shop scheduling with batch processor and limited buffer
    Fu, Qing
    Sivakumar, Appa Iyer
    Li, Kunpeng
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (08) : 2267 - 2285
  • [5] A Hardware Architecture for the Branch and Bound Flow-Shop Scheduling Algorithm
    Daouri, Mikhael
    Escobar, Fernando A.
    Chang, Xin
    Valderrama, Carlos
    2015 NORDIC CIRCUITS AND SYSTEMS CONFERENCE (NORCAS) - NORCHIP & INTERNATIONAL SYMPOSIUM ON SYSTEM-ON-CHIP (SOC), 2015,
  • [6] A modified branch and bound algorithm for a vague flow-shop scheduling problem
    Gholizadeh, H.
    Fazlollahtabar, H.
    Gholizadeh, R.
    IRANIAN JOURNAL OF FUZZY SYSTEMS, 2019, 16 (04): : 55 - 64
  • [7] A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
    Jen-Shiang Chen
    The International Journal of Advanced Manufacturing Technology, 2006, 29 : 1186 - 1193
  • [8] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS
    IGNALL, E
    SCHRAGE, L
    OPERATIONS RESEARCH, 1965, 13 (03) : 400 - &
  • [9] A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
    Chen, Jen-Shiang
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 29 (11-12): : 1186 - 1193
  • [10] A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
    Chen, Jen-Shiang
    International Journal of Advanced Manufacturing Technology, 2006, 29 (11-12): : 1186 - 1193
12345