A constrained multi-products EPQ inventory model with discrete delivery order and lot size

Leopoldo Eduardo Cárdenas-Barrón, Gerardo Treviño-Garza, Gede Agus Widyadana, Hui Ming Wee*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

36 Citations (Scopus)

Abstract

This paper proposes an alternative heuristic algorithm for a multi-product Economic Production Quantity (EPQ) vendor-buyer integrated model with Just in Time (JIT) philosophy and a budget constraint. This type of problem is usually solved by a Mixed Integer Non Linear Problem (MINLP), which is complex and computationally expensive. The proposed heuristic algorithm involves less computation and therefore it is less expensive than the previously published algorithms. Furthermore, the heuristic algorithm is simpler as it derives the integer values for all discrete variables in a straightforward manner. Through empirical experimentation, it is demonstrated that the heuristic algorithm provides solutions closer to the lower bound in a very short time.

Original languageEnglish
Pages (from-to)359-370
Number of pages12
JournalApplied Mathematics and Computation
Volume230
DOIs
Publication statusPublished - 1 Mar 2014
Externally publishedYes

Keywords

  • Branch and bound
  • EPQ
  • Heuristic algorithms
  • JIT
  • Lagrange approach

Fingerprint

Dive into the research topics of 'A constrained multi-products EPQ inventory model with discrete delivery order and lot size'. Together they form a unique fingerprint.

Cite this