Obtain makespan of job shop scheduling operation

Abstract

When a large number of jobs and machines are taken into consideration, efficiency in job shop scheduling plays a vital role. As the number on jobs & machines increase, the job shop scheduling problems approaches NP hard difficulty. Many heuristic methods are devised that produce solutions with near optimal solution. This work deals with the job shop scheduling using an algorithm aimed at creating a mathematical model without machine availability constraint. Operation based representation is used to decode the schedule in the algorithm. A C++ code was used to generate an algorithm for finding the optimal solution. The input parameters are operation time and operation sequence for each job in the machines provided. This work used the makespan values of the schedules to compare the results.