A two-level genetic algorithm to determine production frequencies for economic lot scheduling problem

Sai Ho Chung, Hing Kai Chan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

36 Citations (Scopus)


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.
Original languageEnglish
Article number5741841
Pages (from-to)611-619
Number of pages9
JournalIEEE Transactions on Industrial Electronics
Issue number1
Publication statusPublished - 1 Jan 2012


  • Economic lot scheduling problem (ELSP)
  • genetic algorithm (GA)
  • inventory management
  • supply chain

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this