A Fast Taboo Search Algorithm for the Job Shop Problem
提出一种快速易实现的近似算法，基于禁忌搜索技术求解作业车间的最小完工时间问题，适合需要高效调度方案的场景。
A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific ...