This work analyzes several “level-oriented” algorithms for packing rectangles into a unit-width, infinite-height bin and gives more refined bounds for special cases in which the widths of the given rectangles are restricted and in which only squares are to be packed.Expand

This work considers one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks on m identical, parallel processors with the objective of minimizing the number of overlapping tasks.Expand

Efficient approximation algorithms are devised, their limitations are studied, and worst-case bounds on the performance of the packings they produce are derived.Expand

It is shown that the most general mean-finishing-time problem for independent tasks is polynomial complete, and hence unlikely to admit of a non-enumerative solution.Expand

This work generalizes the classical one-dimensional bin packing model to include dynamic arrivals and departures of items over time, and shows that no on-line packing algorithm can satisfy a substantially better performance bound than that for First Fit.Expand

Abstract Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints represented by a graph G , such that tasks represented by… Expand