Fast approximation algorithm for the multislot just-in-time scheduling problem

Abstrakt

In this paper we are concerned with the problem of just in time scheduling with periodic time slots. We design here a fast algorithm which produces a feasible schedule that approximates the optimal schedule with a maximum error of one extra slot.