... Metaheuristics have been applied to solve flow shop scheduling problems, namely the early works of Osman and Potts (1989) and Taillard (1990). For the no-wait flow shop scheduling problems, several metaheuristics have been studied, namely, genetic algorithm (Aldowaisan & Allahverdi, 2003;Chen, Neppalli, & Aljaber, 1996), simulated annealing (Fink & Voß, 2003), tabu search (Grabowski & Pempera, 2005), particle swarm optimization (Liu, Wang, & Jin, 2007;Pan, Tasgetiren, & Liang, 2008;Pan, Wang, Tasgetiren, & Zhao, 2008), artificial immune system (Kumar, Prakash, Shankar, & Tiwari, 2006), hybrid tabu search and particle swarm optimization (Samarghandi & ElMekkawy, 2012), ant colony optimization algorithm (Shyu, Lin, & Yin, 2004), hybrid genetic algorithm and variable neighborhood search algorithm (Jarboui, Eddaly, & Siarry, 2011), and differential evolution (Qian, Wang, Hub, Huang, & Wang, 2009). Constructive heuristics are frequently used for generating good starting solutions for the metaheuristics. ...