The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

4th ModTech International Conference - Modern Technologies in Industrial Engineering

Paprocka, I.^2 ; Kempa, W.M.^1 ; Grabowik, C.^2 ; Kalinowski, K.^2 ; Krenczyk, D.^2

Silesian University of Technology, Faculty of Applied Mathematics, Institute of Mathematics, Kaszubska 23, Gliwice

44-100, Poland^1

Silesian University of Technology, Faculty of Mechanical Engineering, Institute of Engineering Processes Automation and Integrated Manufacturing Systems, Konarskiego 18A, Gliwice

44-100, Poland^2

关键词: Job shop scheduling problems;    Mean time to failure;    Planned maintenance;    Predictive scheduling;    Reactive scheduling;    Reliability characteristics;    Robustness criterion;    Scheduling problem;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/145/4/042019/pdf
DOI  :  10.1088/1757-899X/145/4/042019

来源: IOP

【 摘 要 】

In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.