On the n-job, m-machine permutation ow shop scheduling problems with makespan criterion and rework

This paper addresses n-job, m-machine Permutation Flow Shop Scheduling Problem (PFSSP) with unlimited intermediate buers and rework activities. The concept of rework means that processing of a job on a machine may not meet a predened quality level through its rst process. Thus, we have a probabilistic cycle of operations for jobs on dierent machines based on two concepts: (1) A failure probability of a job on a machine; and (2) A descent rate that reduces processing times for the rework phase. In this case, the processing times of jobs on machines become random variables with a known probability distribution. The aim of this paper is to examine possible solution approaches to generate ecient job sequences with the least potential makespan. A wide range of simulationbased approaches are applied to address the proposed problem. These methods contain mathematical formulation, heuristic algorithms, and metaheuristics. The mechanism of the solution approaches is based on, rstly, using expected processing times to nd a job sequence and, secondly, on evaluating the obtained job sequences by several simulated trials. Using the one-way ANOVA test, these methods have been compared together, and the results show the superiority of metaheuristics, especially simulated annealing, over the other method