A parallel algorithm for the dynamic lot-sizing problem

Jung Lyu, Ming Chang Lee

研究成果: Article

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)127-134
頁數8
期刊Computers and Industrial Engineering
41
發行號2
DOIs
出版狀態Published - 2001 十一月 1

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

指紋 深入研究「A parallel algorithm for the dynamic lot-sizing problem」主題。共同形成了獨特的指紋。

  • 引用此