Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
研究将作业按族分组、族间有主要设置时间、族内作业有次要设置时间的单机调度问题，提出禁忌搜索算法以最小化一般正则成本函数，并给出计算实验结果。
The paper deals with a single machine scheduling problem in which jobs are grouped into families that require major setup times, and where jobs within families require for processing minor setup times. The former are sequence independent and the latter have special triangular structure. The problem is to find a partition of families into batches, sequences of jobs in particular batches and a sequence of batches which minimize a general regular cost function. The tabu search algorithm for finding near-optimal schedules is proposed and results of computational experiments are presented.