To the problem that it takes a long time for current available algorithms to solve large-scale flow shop scheduling problems(FSPs),a fast taboo search algorithm based on Block properties of FSP is proposed to reduce the neighborhood size.

• 为解决现有算法在求解大规模流水线调度问题(FSP)时计算时间过长的问题；从缩小邻域的角度出发；提出一种基于FSP问题Block性质的快速禁忌搜索(TS)算法.