Scheduling job execution with package processing

The paper is concerned with developing a schedule for processing a set of interrelated jobs so as to meet the deadlines within the resources of the computing systems. Algorithms are proposed for developing admissible schedules whose length is minimal in single-programming and near-minimal in multiprogramming enoironment. Data are given on application of the results.