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 条
  • [31] Dynamic and Stochastic Job Shop Scheduling Problems Using Ant Colony Optimization Algorithm
    Zhou, Rong
    Goh, Mark
    Chen, Gang
    Luo, Ming
    De Souza, Robert
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON OPERATIONS AND SUPPLY CHAIN MANAGEMENT (ICOSCM 2010), 2010, 4 : 310 - 315
  • [32] The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems
    Paprocka, I.
    Kempa, W. M.
    Grabowik, C.
    Kalinowski, K.
    Krenczyk, D.
    MODTECH INTERNATIONAL CONFERENCE - MODERN TECHNOLOGIES IN INDUSTRIAL ENGINEERING IV, PTS 1-7, 2016, 145
  • [33] Metaheuristic agent teams for job shop scheduling problems
    Aydin, Mehmet E.
    HOLONIC AND MULTI-AGENT SYSTEMS FOR MANUFACTURING, PROCEEDINGS, 2007, 4659 : 185 - 194
  • [34] A new heuristic operator for job shop scheduling problems
    Zhao, Liang-hui
    Deng, Fei-qi
    2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1375 - +
  • [35] Fuzzy job-shop scheduling problems: A review
    Abdullah, Salwani
    Abdolrazzagh-Nezhad, Majid
    INFORMATION SCIENCES, 2014, 278 : 380 - 407
  • [36] NEIGHBORHOOD ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEMS
    Ishigaki, Aya
    Matsui, Yuki
    ICIM'2016: PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2016, : 3 - 8
  • [37] Research on the Model and Solving of Job Shop Scheduling Problems
    Chen Tao
    Gao Liqun
    MEMS, NANO AND SMART SYSTEMS, PTS 1-6, 2012, 403-408 : 2654 - 2658
  • [38] An Imperialist Competitive Algorithm for the Job Shop Scheduling Problems
    Piroozfard, H.
    Wong, K. Y.
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 69 - 73
  • [39] Hardness of Approximating Flow and Job Shop Scheduling Problems
    Mastrolilli, Monaldo
    Svensson, Ola
    JOURNAL OF THE ACM, 2011, 58 (05)
  • [40] Analysis of reactive scheduling problems in a job shop environment
    Sabuncuoglu, I
    Bayiz, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (03) : 567 - 586