Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times

Abstract EN

The problem of scheduling jobs with delivery times on parallel machines is studied, where each job can only be processed on a specific subset of the machines called its processing set.

Two distinct processing sets are either nested or disjoint; that is, they do not partially overlap.

All jobs are available for processing at time 0.

The goal is to minimize the time by which all jobs are delivered, which is equivalent to minimizing the maximum lateness from the optimization viewpoint.

A list scheduling approach is analyzed and its approximation ratio of 2 is established.

In addition, a polynomial time approximation scheme is derived.