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

Abstract

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.

Multi-Interference and Multi-Model Dynamic Scheduling of the Small Satellite Based on Dual Population Genetic Algorithm

“…The main body of scheduling theory was established in the 1960s and 1970s when dynamic programming and integer programming were applied to the modelling of scheduling problems [10]. In the 1980s, people began to pay attention to the research on stochastic scheduling [11]. Many new job shop scheduling (JSP) methods and theories keep emerging, such as tabu search algorithms, integer programming, scheduling algorithm based on heuristic rules, deterministic optimization algorithm, simulated annealing algorithm, artificial intelligence algorithm, etc.…”

“…Intelligent scheduling has become a hot research direction. The basic idea of genetic algorithm (GA) came from evolutionary biology and initially introduced by Professor Holland [11] to solve complex optimization problems by designing appropriate selection, crossover and mutation operators. But the genetic algorithm has some defects, such as slow convergence or local convergence, which undermines the algorithm's solving effect.…”

A Construction Schedule Robustness Measure Based on Improved Prospect Theory and the Copula-CRITIC Method

“…Liu [6] established a robustness criterion using a time slack-based technique to deal with schedules with mechanical malfunction and new job arrivals. Xiao [7] took the expected relative deviation between the planned and actual schedule as a solution robustness criterion and used the criterion to analyze the robustness of the stochastic job shop scheduling problem. Rahmani [8] measured the schedule robustness of job shop production concerning mechanical malfunction through a solution robustness criterion.…”

A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling

“…Thus, in addition to the makespan, the robustness of a schedule will also be taken as one of the objectives in the robust scheduling. Xiao et al [23] addressed the stochastic JSS problem with uncertain processing times, and the robustness took the expected relative deviation between the realized makespan and the predictive makespan. Zuo et al [24] considered both the expectation and standard deviation of the performance of a schedule.…”