Improving the schedule quality of static-list time-constrained scheduling (poster paper)

The schedule-constrained job scheduling problem is defined as the problem of deciding what jobs should co-exist in the memory of a multiprogrammed computer to insure satisfactory schedule performance and adequate resource utilization. At the present ...

In this work we investigate the problem of scheduling instructions on idealized microprocessors with multiple pipelines, in the presence of precedence constraints, release-times, deadlines, and latency constraints. A latency of l_ij specifies that there ...

Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for ...