Modified Shifting Bottleneck Algorithms to Minimize Total Family Tardiness for Job Shop Scheduling with Job Families

Abstract

We consider job shop scheduling in which jobs are grouped into job families, but they are processed individually for the objective of minimizing the total family tardiness, i.e. sum of positive deviations between due-dates and completion times of job families. After describing the problem as a disjunctive graph, modified shifting bottleneck algorithms are suggested. Computational experiments were performed on randomly generated test instances and the test results are reported.