Job-shop scheduling with machine breakdown prediction under completion time constraint

Abstract

This paper discusses the problem of time-constrained job-shop scheduling with technological machine breakdown prediction. The first section gives short characteristics of the field of research, and describes the effects of machine failure on job completion times. Secondly, the discussed problem is represented by means of mathematical equations and solved with original algorithms for machine failure prediction and implementation of redundant service times, and finally, the proposed solutions are verified by means of simulation. In the computational experiment stage a typical production case with taking into account 3 machines failure was considered. The last part of this paper draws conclusions from the study and presents directions of future research work.