Run-based heuristic for scheduling grouped jobs in parallel machines

Abstract This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines with objective of minimizing the sum of tardiness, subject to a secondary resource constraint. A theorem is given, based on which the Integer Programming model and a run-based heuristic approach that requires the implementing time O(m n + n log n) are presented. The results show that it can get a satisfactory solution.