Scheduling with Setup Time Matrix for Sequence Dependent Family

We consider a problem of scheduling n jobs in k families on a single machine subjected to family set-up time to minimize the overall penalty. This paper proposes three heuristic approaches based on neighbourhood structures using setup time matrix. These three approaches minimize the maximum penalty which in turn minimizes the total penalty. Inserting the Idle Time initially (ITF approach) or between the families perform efficiently on large instances. The computational results prove the efficiency of the algorithm.