Scheduling with dependent setups and maintenance in a textile company

This paper deals with a scheduling problem with machine maintenance in a textile company. In the production system, the sequence-dependent setup time of a job cannot be ignored when a switch between two different jobs occurs. This study presents a heuristic to minimize the completion time, or equivalently the total setup time subject to periodic maintenance and due dates. The performance of the heuristic is evaluated by comparing its solution with the solution of the branch-and-bound algorithm. The real data are used to demonstrate the effectiveness of the heuristic.