Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completiontime of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal solution forthis type of complex problem in large sizes in reasonable computational time using traditional approaches or optimization tools isextremely difficult. A meta-heuristic method based on Simulated Annealing (SA) is proposed to solve the presented model. Based on thecomputational analyses, the proposed algorithm was found efficient and effective at finding good quality solutions.

Keywords:

Scheduling , Simulate annealing , Flow line manufacturing , Setup times , Makespan