Three machines flowshop scheduling model with separate setup times

Abstract

In this paper, we have developed a new heuristic algorithm for three machines flowshop scheduling problem using five parameters together. The parameters, which we have used in this paper, are separate setup times, transportation times, Job block, weight of job and specified rental policy. The main aim to introduce this algorithm is to obtain the optimal sequence to minimize the makespan, utilization times and rental cost of the machines. We used the Johnson's Techniques of three machines for developing this heuristic algorithm. A numerical illustration is also provided to verify the effectiveness of developed heuristic algorithm.