An integrated tabu search algorithm for the lot streaming problem in flexible job shops

To solve the problem of flexible job shop scheduling with lot-splitting, a flexible size lot-splitting scheduling algorithm based on tabu search was presented, which incorporates the predetermination of sublot sizes, the determination of schedules based on tabu search and the variation of sublot sizes, to minimize the makespan and machine workload. Performance of the algorithm was evaluated through simulations, and the results demonstrate the feasibility, efficiency and utility of the algorithm.