A parallel algorithm for the dynamic lot-sizing problem

Jung Lyu, Ming Chang Lee

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

The dynamic lot-sizing model (DLS) is one of the most frequently used models in production and inventory system because lot decisions can greatly affect the performance of the system. The practicality of DLS algorithms is hindered by the huge amount of computer resources required for solving these models, even for a modest problem. This study developed a parallel algorithm to solve the lot-sizing problem efficiently. Given that n is the size of the problem, the complexity of the proposed parallel algorithm is O(n2p) with p processors. Numerical experiments are provided to verify the complexity of the proposed algorithm. The empirical results demonstrate that the speedup of this parallel algorithm approaches linearity, which means that the proposed algorithm can take full advantage of the distributed computing power as the size of the problem increases.

Original languageEnglish
Pages (from-to)127-134
Number of pages8
JournalComputers and Industrial Engineering
Volume41
Issue number2
DOIs
Publication statusPublished - 2001 Nov 1

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'A parallel algorithm for the dynamic lot-sizing problem'. Together they form a unique fingerprint.

Cite this