Scheduling with Maintenance Technique in Dynamic Job Shop System including Machine Breakdowns
Kaouther Ben Ali, AchrafJabeur Telmodi and Said Gattoufi
Published: February 17, 2022
DOI: 10.55162/MCET.02.019
Abstract
Machine scheduling is concerned with the problem of optimally scheduling available machines. However, scheduling literature review has been focused on common assumptions that machines are available at all times. The availability constraint is may not frequency occurred because a machine may become unavailable during a certain periods of time. This paper is addressed to study the problem of job shop in dynamic environment with the risk of random machine breakdown. It is considered a NP Hard optimization problem. Predictive maintenance is an answer to prevent the system from risk of machine breakdown. The objective function is to minimize the completion time of the last job being executed. Hence, we propose a met heuristic approach based on GA approach to solve the issue. Experimentation results assume that the used approach based on maintenance function is required to produce, for each machine, the adequate scheduling plan.
Keywords: dynamic job shop scheduling problem; genetic algorithm; makespan; preventive maintenance; operating schedule; optimization problem