Scheduling with Resource Allocation, Deteriorating Effect and Group Technology to Minimize Total Completion Time

This paper studies a single-machine problem with resource allocation (RA) and deteriorating effect (DE). Under group technology (GT) and limited resource availability, our goal is to determine the schedules of groups and jobs within each group such that the total completion time is minimized. For three special cases, polynomial time algorithms are given. For a general case, a heuristic, a tabu search algorithm, and an exact (i.e., branch-and-bound) algorithm are proposed to solve this problem.