A linear time algorithm for restricted bin packing and scheduling problems

  • Authors:

  • J. Baewicz;K. Ecker

  • Affiliations:

  • Politechnika Poznaska, Instytut Automatyki, ul. Piotrowo 3a, 60-965 Pozna, Poland;Technical University of Clausthal, Institute of Mathematics, Clausthal Zellerfeld, Fed. Rep. Germany

  • Venue:
  • Operations Research Letters
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we are concerned with the subproblem of bin packing, where the set of possible weights of elements is finite. In [5] it was mentioned that this problem could be solved by an exhaustive search procedure in polynomial time, but the degree of the polynomial is high and increases as the cardinality of the set of weights increases. However, we will show that a more careful analysis of the problem leads to a linear time algorithm. The impact of this result on task scheduling is discussed.