Single Machine Scheduling to Minimize Total Tardiness withSequence-Dependent Setup Timescompletion time of job

摘要

The problem of scheduling jobs on a single resource is one of the many problems that are widely studied inscheduling literature. Nevertheless, optimally solving this problem in the presence of additional constraints is stilldifficult. The solution of the single machine scheduling problem to minimize total tardiness in the presence ofsequence-dependent setup times is one such problem. This paper presents three Genetic Algorithm-basedapproaches to solve the above SMS problem. The results are compared to those obtained from other methods toevaluate the effectiveness of the proposed methods.