Based on the framework, an algorithm, GA-SPTS, is developed for job shop scheduling problems with sequence-dependent setup times, which shows high performance compared with the existing algorithms.

• 在以上框架基础上，针对含调整时间的作业排序问题建立了一种混合算法GA-SPTS，通过与已有算法的比较表明，该算法对这类问题具有很好的求解性能。