Tabu search for minimizing the sum of total flow time of N grouped jobs on M parallel machines

This paper presents a job scheduling model of M identical machines in parallel. The model assumes that a set-up time is incurred when a machine changes from processing one type of parts to a different type of parts. And the scheduling objective is to minimize the sum of total flow time. We establish two optimal algorithm methods which are made of tabu search combined with heuristic and B and B, denote as TS-HEU and TS-B&B.