Scheduling in a permutation flowshop refers to processing of jobs set available machines the same order. Among several possible performance characteristics flowshop, makespan remains one highest preferred metrics by researchers past six decades. The constructive heuristic proposed Nawaz-Enscore-Ham (NEH) is best for minimization. essentially depends on initial ordering according particular prio...

This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...

A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are represe...

Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machinesequence-dependent set-up time constraints S.F. Attar a , M. Mohammadi a , R. Tavakkoli-Moghaddam b & S. Yaghoubi c a Department of Industrial Engineering, Faculty of Engineering , Kharazmi University , Karaj , Iran b Department of Industrial Engineering, College of Engineering and Center of Exc...