A new algorithm for determining production schedules when solving the multi-product economic lot sizing problem in flow shops

Jia Yen Huang*, Ming-Jong Yao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

In this paper, we study the generation of production schedules in the multi-product economic lot sizing problem in flow shops (i.e., the FS-ELSP) under the power-of-two policy. To investigate this problem, we first review the mathematical model for the FS-ELSP and Ouenniche and Boctor's (O&B's) heuristic, and we comment that there exist several problems in O&B's heuristic if we try to use it to generate feasible production schedules for the FS-ELSP. Therefore, we propose two new heuristics, namely, the modified O&B's heuristic and Huang and Yao's (H&Y's) heuristic to improve O&B's heuristic. To compare the performance of these three heuristics, we randomly generate 500 instances for each of the seven levels of utilization rate from 0.4 to 0.75. Based on our numerical experiments, we conclude that H&Y's heuristic significantly outperforms O&B's heuristic and the modified O&B's heuristic.

Original languageEnglish
Pages (from-to)560-578
Number of pages19
JournalInternational Journal of Advanced Manufacturing Technology
Volume33
Issue number5-6
DOIs
StatePublished - 1 Jun 2007

Keywords

  • Flow shop
  • Lot scheduling
  • Production schedule
  • Utilization rate

Fingerprint Dive into the research topics of 'A new algorithm for determining production schedules when solving the multi-product economic lot sizing problem in flow shops'. Together they form a unique fingerprint.

Cite this