Keshavarz, Taha; Salmasi, Nasser - In: European Journal of Industrial Engineering 8 (2014) 3, pp. 366-387
In this research, a permutation flowshop sequence-dependent group scheduling problem with minimisation of total completion time is considered. Since the problem is shown to be strongly NP-hard, a hybrid genetic (HG) algorithm is proposed. The only available lower bounding (LB) method for the...