Hybrid genetic algorithm for the economic lot-scheduling problem

被引：64
|
作者：
Moon, I [1 ]
Silver, EA
Choi, S
机构：
[1] Pusan Natl Univ, Dept Ind Engn, Pusan 609735, South Korea
[2] Univ Calgary, Fac Management, Calgary, AB T2N 1N4, Canada
[3] Univ Calgary, Dept Mfg Engn, Calgary, AB T2N 1N4, Canada
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2002年 / 40卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
10.1080/00207540110095222
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied over 40 years. Numerous heuristic algorithms have been developed since the problem is NP-hard. Dobson's heuristic has been regarded as the best in its performance. The present paper provides a hybrid genetic algorithm based on the time-varying lot sizes approach in the ELSP literature. Numerical experiments show that the hybrid genetic algorithm outperforms Dobson's heuristic.
引用
收藏
页码：809 / 824
页数：16
相关论文
共 50 条
12345