We show that a modification of the Kenyon¨CRemila algorithm for the strip-packing problem yields an improved bound on the value of the approximate solution. As a corollary we derive that there exists a polynomial-time algorithm that always finds a solution of value where mlns="""">OPT is the optimal value.