Scheduling with deadlines and loss functions. (English) Zbl 1047.90504

McNaughton, Robert

Manage. Sci. 6, 1-12 (1959).

Summary: The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks.
Each task has a deadline; the individual loss associated with it is a function of amount of time between the deadline and the time of completion if the former precedes the latter, and zero otherwise.

MSC:

90B35

Deterministic scheduling theory in operations research