Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines

TL;DR

This paper develops efficient exact algorithms for scheduling equal-length jobs on uniform parallel batch machines with processing set restrictions, optimizing various objectives including makespan, under different release time scenarios.

Contribution

It introduces novel algorithms tailored for scheduling on uniform parallel batch machines with processing set restrictions, addressing both equal and unequal release times.

Findings

Efficient algorithms for equal release time scenarios.

Optimal solutions for minimizing makespan with unequal release times.

Applicability to diverse scheduling objectives.

Abstract

We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with non-identical capacities where each job can only be processed on a specified subset of machines called its processing set. For the case of equal release times, we give efficient exact algorithms for various objective functions. For the case of unequal release times, we give efficient exact algorithms for minimizing makespan.