Minimizing total completion time on parallel machines with unit length jobs that need one additional resource

The paper considers a scheduling problem on parallel identical machines to minimize the sum of the completion times. All jobs are of unit length and require one unit of one of the additional resources. We offer an algorithm that is much faster and simpler than previously available.