Surrogate Measures for the Robust Scheduling of Stochastic Job Shop Scheduling Problems

被引:14
|
作者
Xiao, Shichang [1 ,2 ]
Sun, Shudong [1 ]
Jin, Jionghua [2 ]
机构
[1] Northwestern Polytech Univ, Minist Educ, Key Lab Contemporary Design & Integrated Mfg Tech, Xian 710072, Peoples R China
[2] Univ Michigan, Dept Ind & Operat Engn, Ann Arbor, MI 48105 USA
基金
中国国家自然科学基金;
关键词
robust scheduling; stochastic job shop scheduling problems; surrogate measures; stochastic processing times; hybrid estimation of distribution algorithm; RANDOM MACHINE BREAKDOWNS; DISTRIBUTION ALGORITHM; GENETIC ALGORITHM; OPTIMIZATION; STABILITY;
D O I
10.3390/en10040543
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
This study focuses on surrogate measures (SMs) of robustness for the stochastic job shop scheduling problems (SJSSP) with uncertain processing times. The objective is to provide the robust predictive schedule to the decision makers. The mathematical model of SJSSP is formulated by considering the railway execution strategy, which defined that the starting time of each operation cannot be earlier than its predictive starting time. Robustness is defined as the expected relative deviation between the realized makespan and the predictive makespan. In view of the time-consuming characteristic of simulation-based robustness measure (RMsim), this paper puts forward new SMs and investigates their performance through simulations. By utilizing the structure of schedule and the available information of stochastic processing times, two SMs on the basis of minimizing the robustness degradation on the critical path and the non-critical path are suggested. For this purpose, a hybrid estimation of distribution algorithm (HEDA) is adopted to conduct the simulations. To analyze the performance of the presented SMs, two computational experiments are carried out. Specifically, the correlation analysis is firstly conducted by comparing the coefficient of determination between the presented SMs and the corresponding simulation-based robustness values with those of the existing SMs. Secondly, the effectiveness and the performance of the presented SMs are further validated by comparing with the simulation-based robustness measure under different uncertainty levels. The experimental results demonstrate that the presented SMs are not only effective for assessing the robustness of SJSSP no matter the uncertainty levels, but also require a tremendously lower computational burden than the simulation-based robustness measure.
引用
收藏
页数:26
相关论文
共 50 条
  • [21] A Rollout Metaheuristic for Job Shop Scheduling Problems
    Carlo Meloni
    Dario Pacciarelli
    Marco Pranzo
    Annals of Operations Research, 2004, 131 : 215 - 235
  • [22] Cyclic job shop scheduling problems with blocking
    Brucker, Peter
    Kampmeyer, Thomas
    ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 161 - 181
  • [23] Improved Variable Neighbourhood Search Algorithm for Robust Job Shop Scheduling Problems
    Lan, Fengming
    Wang, Bing
    Zhang, Xianxia
    2016 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS (IHMSC), VOL. 2, 2016, : 592 - 595
  • [24] Robust scheduling for flexible job-shop problems with uncertain processing times
    Li, Wan-Ling
    Murata, Tomohiro
    Fazli Bin Md Fauadi, Muhammad Hafidz
    IEEJ Transactions on Electronics, Information and Systems, 2015, 135 (06) : 713 - 720
  • [25] Research on the Dual-resource Constrained Robust Job Shop Scheduling Problems
    Xiao, Shichang
    Wu, Zigao
    Sun, Shudong
    Jin, Mei
    Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2021, 57 (04): : 227 - 239
  • [26] Mathematical Models of Flow Shop and Job Shop Scheduling Problems
    Seda, Milos
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 122 - 127
  • [27] A stochastic strategy for solving job shop scheduling problem
    Yin, AH
    Huang, WQ
    2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, 2002, : 434 - 439
  • [28] A Robust Heuristics for the Online Job Shop Scheduling Problem
    Zupan, Hugo
    Herakovic, Niko
    Zerovnik, Janez
    ALGORITHMS, 2024, 17 (12)
  • [29] Decomposition heuristics for robust job-shop scheduling
    Byeon, ES
    Wu, SD
    Storer, RH
    IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1998, 14 (02): : 303 - 313
  • [30] ROBUSTNESS MEASURES AND ROBUST SCHEDULING FOR JOB SHOPS
    LEON, VJ
    WU, SD
    STORER, RH
    IIE TRANSACTIONS, 1994, 26 (05) : 32 - 43