Single-machine group scheduling with processing times dependent on position, starting time and allotted resource

Abstract

This article considers scheduling problems on a single machine with learning effect, deteriorating jobs and resource allocation under group technology (GT) assumption. We assume that the actual processing time of a job depends on the job position, the group position, the starting time and the amount of resource allocated to them concurrently, and the actual setup times of groups depend on the group position and the amount of resource allocated to them concurrently. Two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost. We prove that the problems have polynomial solutions under the condition that the number of jobs in each group are the same.