Due-date scheduling on parallel machines with job splitting and sequence-dependent major/minor setup times

This paper addresses job scheduling problems with parallel machines. To satisfy customers better in a manufacturing company, meeting due dates has been an important performance metric. Besides the numerous other factors affecting due date satisfaction, the splitting of a job through parallel machines can contribute to the reduction of production lead time, resulting in less job tardiness against their due dates. Thus, this paper presents heuristic algorithms for minimizing total tardiness of jobs to meet their due dates in a manufacturing shop with identically functioning machines. The algorithms take into account job splitting and sequence-dependent major/minor setup times. The performance of the proposed heuristics is compared with that of past three algorithms in the literature.