Production scheduling in identical parallel machines to minimize makespan with an application

In this study, the problem of scheduling identical parallel machines in the casting workshop of an armature producer has been discussed. To solve the problem, a 0-1 mixed integer mathematical model was developed to minimize the makespan. With the solution of the mathematical model developed for the multi-machine case, it is determined which jobs will be assigned to which batch, which batch will be assigned to which machine and in which time interval and in which order. Due to the fact that the scheduling process needs to be completed in a short time and the mathematical models are ineffective in solving large-scale problems, an algorithm has been developed to find very good solutions for this problem in a short period of time.