Abstract :
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior. Linear time algorithms are then introduced which, though "faster" than FIRST FIT and BEST FIT, have the same, or better, worst case behavior. Finally, an improved polynomial-time algorithm is found for a problem of scheduling on multiprocessing systems, by treating this as a bin packing problem.
