New Algorithm for Economic Lot Scheduling Problem

被引：0
|
作者：
Luo, Rongwu [1 ]
机构：
[1] Cent S Univ, Traff & Transportat Engn Sch, Changsha 410075, Hunan, Peoples R China
来源：
PROCEEDINGS OF 2010 INTERNATIONAL CONFERENCE ON LOGISTICS SYSTEMS AND INTELLIGENT MANAGEMENT, VOLS 1-3 | 2010年
关键词：
Economic Lot Scheduling Problem; Algorithm; Time-varying Lot Size Approach; Inventory; SIZES;
D O I：
暂无
中图分类号：
TH [机械、仪表工业];
学科分类号：
0802 ;
摘要：
This paper uses time-varying lot size approach to solve Economic Lot Scheduling Problem (ELSP) and offers an efficient algorithm. The new algorithm, by defining and finding out obstacle items (the item with longer average production time is taken as obstacle item), and loading items to bins (obstacle items are loaded preferencially), can offer high quality solutions. Tested by Bomberger's example, the solution shows that the new algorithm is better than previous algorithms.
引用
收藏
页码：334 / 337
页数：4
相关论文
共 50 条
12345