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 条
  • [31] An estimation of distribution algorithm for hybrid flow shop scheduling under stochastic processing times
    Wang, K.
    Choi, S. H.
    Qin, H.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (24) : 7360 - 7376
  • [32] Hybrid estimation of distribution algorithm for stochastic Job shop scheduling with earliness/tardiness penalty
    School of Mechanical Engineering, Northwestern Polytechnical University, Xi'an
    710072, China
    Kongzhi yu Juece Control Decis, 10 (1854-1860):
  • [33] Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties
    Engin, Orhan
    Engin, Batuhan
    JOURNAL OF ENTERPRISE INFORMATION MANAGEMENT, 2018, 31 (06) : 925 - 936
  • [34] Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA
    Yu, Andrew Junfang
    Seif, Javad
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 97 : 26 - 40
  • [35] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
    D. Ravindran
    S.J. Selvakumar
    R. Sivaraman
    A. Noorul Haq
    The International Journal of Advanced Manufacturing Technology, 2005, 25 : 1007 - 1012
  • [36] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
    Ravindran, D
    Haq, AN
    Selvakuar, SJ
    Sivaraman, R
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 25 (9-10): : 1007 - 1012
  • [37] A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
    Essafi, Imen
    Mati, Yazid
    Dauzere-Peres, Stephane
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) : 2599 - 2616
  • [38] Discrete Differential Evolutionary Algorithm for Job-Shop Scheduling Problem with Minimizing Total Weighted Tardiness
    Ye, Furong
    You, Zhen
    Zhang, Defu
    Leung, Stephen C. H.
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 56 - 62
  • [39] Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
    Baruch Mor
    Gur Mosheiov
    Dvir Shabtay
    Journal of Scheduling, 2021, 24 : 553 - 567
  • [40] Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization
    N. R. Srinivasa Raghavan
    M. Venkataramana
    The International Journal of Advanced Manufacturing Technology, 2009, 41 : 986 - 996