Abstract: In this paper, the use of beam search and look-ahead strategies for solving the strip packing problem (SPP) is investigated. Given a strip of fixed width W, unlimited length L, and a set of n circular pieces of known radii, the objective is to determine the minimum length of the initial strip that packs all the pieces. An augmented algorithm which combines beam search and a look-ahead strategies is proposed. The look-ahead is used in order to evaluate the nodes at each level of the tree search. The best nodes are then retained for branching. The computational investigation showed that the proposed augmented algorithm is able to improve the best known solutions of the literature on most instances used.
Abstract: The simple methods used to plan and measure non
patterned production system are developed from the basic definition
of working efficiency. Processing time is assigned as the variable
and used to write the equation of production efficiency.
Consequently, such equation is extensively used to develop the
planning method for production of interest using one-dimensional
stock cutting problem. The application of the developed method
shows that production efficiency and production planning can be
determined effectively.