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 条
  • [1] Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems
    Xiao-Ning Shen
    Ying Han
    Jing-Zhi Fu
    Soft Computing, 2017, 21 : 6531 - 6554
  • [2] Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems
    Shen, Xiao-Ning
    Han, Ying
    Fu, Jing-Zhi
    SOFT COMPUTING, 2017, 21 (21) : 6531 - 6554
  • [3] A hybrid method for solving stochastic job shop scheduling problems
    Tavakkoli-Moghaddam, R
    Jolai, F
    Vaziri, F
    Ahmed, PK
    Azaron, A
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (01) : 185 - 206
  • [4] Robust Solutions to Job-Shop Scheduling Problems with Operators
    Escamilla, Joan
    Rodriguez-Molins, Mario
    Salido, Miguel A.
    Sierra, Maria R.
    Mencia, Carlos
    Barber, Federico
    2012 IEEE 24TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2012), VOL 1, 2012, : 299 - 306
  • [5] SURROGATE DUALITY RELAXATION FOR JOB SHOP SCHEDULING
    FISHER, ML
    LAGEWEG, BJ
    LENSTRA, JK
    KAN, AHGR
    DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 65 - 75
  • [6] A two-stage assignment strategy for the robust scheduling of dual-resource constrained stochastic job shop scheduling problems
    Xiao, Shichang
    Wu, Zigao
    Yu, Shaohua
    IFAC PAPERSONLINE, 2019, 52 (13): : 421 - 426
  • [7] Interval job shop scheduling problems
    Deming Lei
    The International Journal of Advanced Manufacturing Technology, 2012, 60 : 291 - 301
  • [8] Interval job shop scheduling problems
    Lei, Deming
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 60 (1-4): : 291 - 301
  • [9] A hybrid genetic algorithm for stochastic job-shop scheduling problems
    Boukedroun, Mohammed
    Duvivier, David
    Ait-el-Cadi, Abdessamad
    Poirriez, Vincent
    Abbas, Moncef
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (04) : 1617 - 1645
  • [10] An expanded genetic algorithm for stochastic job-shop scheduling problems
    Yu, XiaoYi
    Sun, ShuDong
    Chu, Wei
    PROCEEDINGS OF JOURNAL PUBLICATION MEETING (2007), 2007, : 209 - 214