Single Machine Scheduling for Minimizing Earliness/Tardiness Penalties with Sequence-Dependent Setup Times

Abstract

This chapter deals with a single machine system with job release times and sequence-dependent machine setup times. The objective of the problem is to minimize weighted sum of earliness and tardiness penalties. A mixed integer programming formulation for the problem is first presented, and using this formulation, one can easily find optimal solutions for small problems by using a commercial optimization software. Since the problem is NP-hard and the size of a real problem is large, a number of heuristic solution procedures are proposed including genetic algorithm to solve the practical big-sized problems in a reasonable computational time. To assess the performance of the algorithms proposed, a computational experiment was conducted and the results demonstrate that the heuristic algorithms show different performances as the problem characteristics are changed and a heuristic shows much better performance than genetic algorithm for the case when the number of jobs is relatively large.