A Genetic Algorithm for the Economic Lot Scheduling Problem under Extended Basic Period Approach and Power-of-Two Policy

2012 ◽  
pp. 57-65
Author(s):  
Onder Bulut ◽  
M. Fatih Tasgetiren ◽  
M. Murat Fadiloglu
Keyword(s):  
Genetic Algorithm ◽  
Scheduling Problem ◽  
Lot Scheduling ◽  
Basic Period ◽  
Economic Lot Scheduling Problem ◽  
Economic Lot Scheduling

The economic lot scheduling problem under extended basic period and power-of-two policy

2009 ◽  
Vol 4 (2) ◽  
pp. 157-172 ◽  
Author(s):  
Hainan Sun ◽  
Huei-Chuen Huang ◽  
Wikrom Jaruphongsa
Keyword(s):  
Scheduling Problem ◽  
Lot Scheduling ◽  
Basic Period ◽  
Economic Lot Scheduling Problem ◽  
Economic Lot Scheduling

An Algorithm for Economic Lot Scheduling Problem

2014 ◽  
Vol 945-949 ◽  
pp. 3097-3101
Author(s):  
Rong Wu Luo ◽  
Ru He Xie ◽  
Long Wen Xiao ◽  
Yi Feng Zou
Keyword(s):  
Total Production ◽  
Scheduling Problem ◽  
Daily Cost ◽  
Production Time ◽  
Lot Scheduling ◽  
Basic Period ◽  
Economic Lot Scheduling Problem ◽  
Economic Lot Scheduling ◽  
Very High

The Economic Lot Scheduling Problem (ELSP) has been well-researched for over half a century. This paper, by using extended basic period approach, offers a new algorithm which differs from previous algorithms in that every item is of different importance. Such an item, whose daily cost is very high, is considered to be of greater importance and is called “key item”; and such an item, whose total production time per times is long, is considered to be of greater importance and is called “obstacle item”. By making key items’ multipliers to be of good compatibility and loading obstacle items preferentially, new algorithm can offer good solution.

Sign in / Sign up

Export Citation Format

Share Document