Flexible job shop scheduling operation

Abstract

When a large number of jobs and machines are taken into account, efficiency in the Job shop scheduling plays an essential role. In case of classical job shop scheduling, an operation is allowed to be processed by any machine from a given set and the FJSP is an extension of the classical job shop scheduling problem. The problem consists of two steps, one is to assign each operation to a machine and the second is to sequence the operations on the machines, such that the maximum completion time (makespan) of all operations is minimized. Many heuristics methods are designed as solutions with a close to optimal solution. This work deals with the job shop scheduling using Genetic algorithm aimed at creating a mathematical model with precedence order of the jobs as constraint. A MATLAB code will be used to generate an algorithm for finding the optimal solution. The input parameters are the operating time and the sequence of operation for each job in the machines provided. The makespan value is used to compare the results