By Topic

A Two-Level Genetic Algorithm to Determine Production Frequencies for Economic Lot Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sai Ho Chung ; Hong Kong Polytech. Univ., Hong Kong, China ; Hing Kai Chan

The economic lot scheduling problem (ELSP) has been studied over 50 years. ELSP is known as NP-hard and hence heuristic algorithms have been developed. In those heuristics, researchers generally adopted two types of rounding-off methods for the production frequency of products, namely, the nearest integer and power-of-two approaches. The production frequency of products defines the number of times that such product being produced during the cycle. Therefore, different production frequency actually leads to different optimization results even for the same set of products. For this reason, this paper proposes a two-level genetic algorithm to deal with this problem. A number of numerical examples found in literature and randomly generated problem sets are used to test and benchmark the performance of the new approach. The comparison shows that the new approach outperforms the other existing approaches and also demonstrates the significance of the production frequency to the optimization results.

Published in:

Industrial Electronics, IEEE Transactions on  (Volume:59 ,  Issue: 1 )