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

作者:

Highlights:

摘要

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.

论文关键词:EPQ,JIT,Lagrange approach,Branch and bound,Heuristic algorithms

论文评审过程:Available online 21 January 2014.

论文官网地址:https://doi.org/10.1016/j.amc.2013.12.077