Minimizing Total Tardiness on Uniform Parallel Machines under Human Resource Constraints

Abstract

We consider a class of scheduling problems to minimize total tardiness on uniform parallel machines with human resource constraints, in which each machine requires an operator to process a job. We conduct a branch and bound algorithm for this problem and examine the efficiency of it by numerical examples.