The bin packing problem is a of finding an assignment sequence items to minimum number bins, each capacity one. An online algorithm for the that irrevocably assigns item one by from head sequence. Gutin, Jensen, and Yeo (2006) considered version in which all are only two different sizes knows possible advance, gave optimal case when larger size exceeds 1/2. In this paper we provide some cases a...