A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines

Abstrakt

In this paper we study a scheduling problem on identical parallel machines with a due date assigned to each job. The objective is to maximize the number of just-in-time jobs.

We give a quadratic time algorithm solving the problem.