Weiguo Wang

Multidimensional on-line bin-packing: an algorithm and its average-case analysis

Abstract We describe an algorithm for on-line d-dimensional bin packing which achieves O(n (d+1) (d+2) ) average wasted space. This algorithm runs in linear time in the number of items packed.

WORST AND AVERAGE CASE EVALUATION OF HEURISTICS FOR MULTI-PROCESSOR SCHEDULING

Since the general problem of optimal multiprocessor scheduling is NP-Hard, a lot of research effort has focused on developing heuristic methods. Simple and low cost heuristic algorithms that produce fairly good schedules are of interest for practical reasons. In this work, we give an extensive analysis of the existing Heavy Node First(HNF) algorithm, and propose an improved version called Multi-level Heavy Node First (MHNF) algorithm. We also initiate a new approach in worst case evaluation of various heuristics, with which we compare HNF with MHNF. We find that the improved MHNF enjoys the low cost of HNF but better quality of average case scheduling.