A Branch-and-Price Method for the CLSP
In this paper, a brand-and-price method for the multi-item single-level capacitated dynamic lotsizing problem abbreviated as CLSP is proposed. The objective of the lot-sizing problem is to derive the optimal production plan (lots) so as to the total sum of production, set-up, and inventory costs in a given horizon is minimal and satisfying demand and capacity restriction in each period. We propose the solution method by first transforming the CLSP into an equivalent set partitioning problem by introducing a dominant schedule set for each item, and then a branch-and-price algorithm is introduced for the resulting set partitioning problem. The major components and implementation of the algorithm are described in detail. Some more detailed implementation issues for the algorithm are also discussed in this paper. Computational results for some randomly generated larger problem instances are used to verify the effectiveness of the proposed method.
Zhen Gao Lixin Tang
the Logistics Institute Northeastern University Shenyang, P. R. China 110004
国际会议
南宁
英文
2007-07-20（万方平台首次上网日期，不代表论文的发表时间）