Objects of various integer sizes, o,, o , are to be packed together into bins of size N as they arrive at a service facility. The number of objects of size o, which arrive by time t is A , where the components of A' = (A , * , A ')' are independent renewal processes, with A'/t A as t --oo. The empty space in those bins which are neither empty nor full at time t is called the wasted space and th...