论文部分内容阅读
In this paper, the job shop scheduling problem concerned with minimizing make-span is discussed, and a new local search algorithm is proposed for it. This local search method is based on an improved shifting bottleneck procedure and Tabu Search technique.