论文信息 - A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm

A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm

In 1985, Johnson and Garey[4] devised an algorithm which they call MFFD. Compared with other modifications of the famous FFD algorithm, their is apparently simpler in practical applications and substantially improves the worst case behavior of FFD. In fact, they proved that the inequality MFFD(L)≤71/60OPT(L)+31/6 holds for all the listsL. Their proof requires 40 pages. In this paper we give a proof for the inequality MFFD(L)≤71/60OPT(L)+1, ∀L. The proof is much simpler than theirs.

M. Yue | Lei Zhang

[1] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[2] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[3] David S. Johnson,et al. A 71/60 theorem for bin packing , 1985, J. Complex..

[4] Brenda S. Baker,et al. A New Proof for the First-Fit Decreasing Bin-Packing Algorithm , 1985, J. Algorithms.

[5] M. Yue. On the exact upper bound for the multifit processor scheduling algorithm , 1990 .