Online scheduling for hybrid flexible flow shop with Open-Shop

被引：0
|
作者：
Peng C. [1 ]
Chen Q. [1 ]
Mao N. [1 ]
Li Z. [1 ]
机构：
[1] Guangdong Provincial Key Laboratory of Computer Integrated Manufacturing System, Guangdong University of Technology, Guangzhou
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2019年 / 25卷 / 11期
基金：
中国博士后科学基金;
关键词：
Combined algorithm framework; Hybrid flexible flow shop; Online scheduling; Open-Shop; Priority dispatching rules;
D O I：
10.13196/j.cims.2019.11.008
中图分类号：
学科分类号：
摘要：
Aiming at the online scheduling problem of hybrid flexible flow shop with open-shop characteristics in customized equipment industry, a mathematical model of hybrid flexible flow shop with open-shop characteristics was established. The solution to the issue was divided into two parts for constructing a generation framework of priority dispatching rule based combination algorithm. Priority dispatching rules were embedded into different nodes in the algorithm framework, thus multiple combined algorithms were generated. Considerable calculation examples were designed and simulation experiments were conducted to analyze the effectiveness and adaptability of combined algorithms. The quality of solution was evaluated under various experimental configuration, and the variance analysis of all experimental factors was conducted to investigate their influence on system output and percentage of tardy products. The research could provide guidance to the production planning for workshop production manager. © 2019, Editorial Department of CIMS. All right reserved.
引用
收藏
页码：2775 / 2787
页数：12
相关论文
共 30 条
  • [1] Johnson S.M., Optimal two-and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 1, pp. 61-68, (1954)
  • [2] Garey M.R., Johnson D.S., Sethi R., The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 2, pp. 117-129, (1976)
  • [3] Michael S., A solution of a special class of flow shop scheduling problem, Proceeding of the Symposium on the Theory of Scheduling and its Applications, pp. 83-91, (1973)
  • [4] Gonzalez T., Sahni S., Open shop scheduling to minimize finish time, Journal of the Association for Computing, 23, 4, pp. 665-679, (1976)
  • [5] Liu C.Y., Bulfin R.L., On the complexity of preemptive open-shop scheduling problems, Operations Research Letters, 4, 2, pp. 71-74, (1985)
  • [6] Mao W., Multi-operation multi-machine scheduling, Lecture Notes in Computer Science, 919, pp. 33-38, (1995)
  • [7] Lu J., Shi J., Li X., Et al., Study on hybrid shop robust scheduling problem with known probability distribution, China Mechanical Engineering, 19, 1, pp. 2328-2333, (2010)
  • [8] Lu J., Hu Q., Dong Q., Et al., Cloud manufacturing-oriented mixed-model hybrid shop-scheduling problem, China Mechanical Engineering, 28, 2, pp. 191-198, (2017)
  • [9] Liu M., Wu C., Intelligent Optimal Scheduling Algorithm for Manufacturing Process and its Application, (2008)
  • [10] Wu Y., Research on single piece and small batch mixed shop scheduling algorithm based on MES, (2015)
123