Donald K. Friesen

Variable sized bin packing

In the classical bin packing problem one seeks to pack a list of pieces in the minimum space using unit capacity bins. This paper addresses the more general problem in which a fixed collection of bin sizes is allowed. Three efficient approximation algorithms are described and analyzed. They guarantee asymptotic worst-case performance bounds of 2,

Tighter bounds for the multifit processor scheduling algorithm

{3 / 2}

SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM

and

Tighter bounds for LPT scheduling on uniform processors

{4 / 3}

Bounds for multifit scheduling on uniform processors

.

Evaluation of a MULTIFIT-based scheduling algorithm

This paper considers the problem of nonpreemptively scheduling n independent jobs on m identical, parallel processors with the object of minimizing the “makespan”, or completion time for the entire...

Analysis of a compound bin packing algorithm

This investigation considers the problem of nonpreemptively assigning a set of independent tasks to a system of identical processors to maximize the earliest processor finishing time. While this goal is a nonstandard scheduling criterion, it does have natural applications in certain maintenance scheduling and deterministic fleet sizing problems. The problem is NP-hard, justifying an analysis of heuristics such as the well-known LPT algorithm in an effort to guarantee near-optimal results. It is proved that the worst-case performance of the LPT algorithm has an asymptotically tight bound of

Analysis of Greedy Solutions for a Replacement Part Sequencing Problem

\frac{4}{3}

Embedding rings in recursive networks

times the optimal.

Tight Bound on Johnson's Algorithm for Maximum Satisfiability

We examine the nonpreemptive assignment of independent tasks to a system of uniform processors with the objective of minimizing the makespan. The worst case bound for the largest processing time first algorithm for this problem is tightened to be in the interval (1.52, 1.67).