A New Meta-heuristic for Scheduling of Single Machine Problem with Sequence- Dependent Setups

In many real-world production systems, it requires an explicit consideration of sequence-dependent setup times when scheduling jobs. As for the scheduling criterion, the tardiness, holding and setup costs are always regarded as the most important criteria in practical systems. Considering all of these criterions has received little attention in the scheduling literature. In this paper, we present a new meta-heuristic for such a problem in a single-machine environment. To comply with industrial situations, the dynamic release of jobs is assumed. Also there is an upper limit for the setup cost of each job and based on it, some sequences maybe impossible. It also provides guidelines that can be used by practitioners in the process of selecting the appropriate scheduling methodology