Multiobjective Modeling and Optimization for Scheduling a Stochastic Hybrid Flow Shop With Maximizing Processing Quality and Minimizing Total Tardiness

被引:41
|
作者
Fu, Yaping [1 ,2 ]
Wang, Hongfeng [2 ]
Wang, Junwei [3 ]
Pu, Xujin [4 ]
机构
[1] Qingdao Univ, Sch Business, Qingdao 266071, Peoples R China
[2] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
[3] Univ Hong Kong, Dept Ind & Mfg Syst Engn, Hong Kong, Peoples R China
[4] Jiangnan Univ, Dept Management Sci & Engn, Wuxi 214122, Jiangsu, Peoples R China
来源
IEEE SYSTEMS JOURNAL | 2021年 / 15卷 / 03期
基金
中国国家自然科学基金;
关键词
Job shop scheduling; Stochastic processes; Manufacturing systems; Uncertainty; Mathematical model; Artificial bee colony algorithm; hybrid flow shop; multiobjective scheduling; processing quality; stochastic scheduling; stochastic simulation; MANUFACTURING SYSTEMS; ALGORITHM; TIME; MANAGEMENT; 2-STAGE; DESIGN;
D O I
10.1109/JSYST.2020.3014093
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Currently, manufacturing enterprises attach great importance to improving processing quality and customer satisfaction. Hybrid flow shops have widespread applications in real-world manufacturing systems such as steel production and chemical industry. In a practical production process, uncertainty commonly arises due to the difficulty of knowing exact information of facilities and jobs beforehand. In order to improve processing quality and customer satisfaction of manufacturing systems in uncertain environments, this article proposes a stochastic multiobjective hybrid flow shop scheduling problem aiming at maximizing processing quality and minimizing total tardiness, where the processing time of jobs obeys a known random distribution. To describe jobs' processing quality mathematically, a quality-based cost function is presented, and further a chance-constrained programming approach is used to formulate this problem. Then, a multiobjective artificial bee colony algorithm incorporating a stochastic simulation approach is designed by considering its characteristics. Simulation experiments are performed on a set of instances and several state-of-the-art multiobjective optimization algorithms are chosen as peer approaches. Experiment results confirm that the proposed algorithm has an excellent performance in handling this problem.
引用
收藏
页码:4696 / 4707
页数:12
相关论文
共 50 条
  • [1] Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
    Saber, Reza Ghorbani
    Ranjbar, Mohammad
    COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [2] Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
    Mousavi, Seyyed Mostafa
    Shahnazari-shahrezaei, Parisa
    MANAGEMENT AND PRODUCTION ENGINEERING REVIEW, 2023, 14 (01) : 13 - 24
  • [3] Minimizing total earliness and tardiness in a nowait flow shop
    Schaller, Jeffrey
    Valente, Jorge M. S.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2020, 224
  • [4] Hybrid particle swarm optimization for flow shop scheduling with stochastic processing time
    Liu, B
    Wang, L
    Jin, YH
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 2005, 3801 : 630 - 637
  • [5] Genetic algorithm for minimizing tardiness in flow-shop scheduling
    Onwubolu, Godfrey C.
    Mutingi, Michael
    Production Planning and Control, 10 (05): : 462 - 471
  • [6] Genetic algorithm for minimizing tardiness in flow-shop scheduling
    Onwubolu, GC
    Mutingi, M
    PRODUCTION PLANNING & CONTROL, 1999, 10 (05) : 462 - 471
  • [7] Scheduling hybrid flow shop for minimizing total weight completion time
    Gao, Cong
    Tang, Lixin
    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 809 - 813
  • [8] Research on Multiobjective Flow Shop Scheduling with Stochastic Processing Times and Machine Breakdowns
    Zhou, Qiang
    Cui, Xunxue
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 1718 - +
  • [9] Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem
    Quang Chieu Ta
    Jean-Charles Billaut
    Jean-Louis Bouquard
    Journal of Intelligent Manufacturing, 2018, 29 : 617 - 628
  • [10] Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem
    Ta, Quang Chieu
    Billaut, Jean-Charles
    Bouquard, Jean-Louis
    JOURNAL OF INTELLIGENT MANUFACTURING, 2018, 29 (03) : 617 - 628