Total flow time minimization in a flowshop sequence-dependent group scheduling problem
Keywords: الگوریتمهای فراابتکاری یا فراتکاملی یا فرااکتشافی ; Sequence dependent scheduling; Group scheduling; Branch and price; Metaheuristics; Lower bound