A Tabu Search Algorithm for Single Machine Scheduling Problem with Job Release Times and Sequence - dependent Setup Times

작업 투입시점과 순서 의존적인 작업준비시간이 존재하는 단일 기계 일정계획 수립을 위한 Tabu Search

We present a tabu search (TS) algorithm to minimize maximum lateness on a single machine in the presence of sequence dependent setup times and dynamic job arrivals. The TS algorithm starts with a feasible schedule generated by a modified ATCS (Apparent Tardiness Cost with Setups) rule, then through a series of search steps it improves the initial schedule. Results of extensive computational experiments show that the TS algorithm significantly outperforms a well-known RHP heuristic by Ovacik and Uzsoy, both on the solutions quality and the computation time. The performance advantage is particularly pronounced when there is high competition among jobs for machine capacity.