Unlike a traditional flowshop problem where a job is assumed to be indivisible,in the lot-streaming flowshop problem,a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine.In this way,the production is accelerated.This paper presents a discrete artificial bee colony (DABC) algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion.Unlike the basic ABC algorithm,the proposed DABC algorithm represents a solution as a discrete job permutation.An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity.Employed and onlooker bees generate new solutions in their neighborhood,whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far.Moreover,a simple but effective local search is embedded in the algorithm to enhance local exploitation capability.A comparative experiment is carried out with the existing discrete particle swarm optimization,hybrid genetic algorithm,threshold accepting,simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances.The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality,robustness and effectiveness.This research provides the references to the optimization research on lot-streaming flowshop.