Share This Author
Approximation algorithms for bin packing: a survey
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- E. Coffman, M. Garey, David S. Johnson, R. Tarjan
- Mathematics, Computer ScienceSIAM J. Comput.
- 1 November 1980
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.
An Application of Bin-Packing to Multiprocessor Scheduling
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.
Orthogonal Packings in Two Dimensions
Efficient approximation algorithms are devised, their limitations are studied, and worst-case bounds on the performance of the packings they produce are derived.
Operating Systems Theory
As one of the part of book categories, operating systems theory always becomes the most wanted book.
Scheduling independent tasks to reduce mean finishing time
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.
Dynamic Bin Packing
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.
This article surveys the work that has been done on the treatment of deadlocks from both the theoretical and practical points of view.