Single Machine Group Scheduling with Resource Dependent Setup and Processing Times
Abstract
On a single machine, a set of n jobs partitioned into g groups must be scheduled. Setup times and processing times can be linearly compressed by using a continuously divisible or discrete resource. Jobs must be finished before their deadlines. A polynomial algorithm is proposed.