TY - JOUR
T1 - Modelling and solving of a lot sizing problem for multiple items and multiple periods with shortage
AU - Ganjavi, Nasim
AU - Tavakkoli-Moghaddam, Reza
AU - Sajadi, Seyyed Mojtaba
PY - 2014/12/1
Y1 - 2014/12/1
N2 - This paper presents a multi-period inventory lot sizing scenario, where there is multiple product and single suppliers. It constructs a goal programming model to determine the order quantities of each product in each period. In this model, three goals are considered: 1) meeting the total available periodic budget, 2) meeting the buyer's maximum acceptable quality, 3) minimise the shortage. Constructing the approach in this way effectively reduces the risk of purchasing .The proposed approach provides flexibility to decision maker in multi-period procurement lot-sizing decisions. In other words, the purchase of any product in any period is determined as by the possibility to get closer to the goals defined in the model. It solves utilising GAMS and meta-heuristic algorithms, and analyses the efficiency of the heuristics. Efficiency of the proposed algorithm by comparing genetic algorithm in large size problems show the proposed algorithm has also better efficiency than genetic algorithm.
AB - This paper presents a multi-period inventory lot sizing scenario, where there is multiple product and single suppliers. It constructs a goal programming model to determine the order quantities of each product in each period. In this model, three goals are considered: 1) meeting the total available periodic budget, 2) meeting the buyer's maximum acceptable quality, 3) minimise the shortage. Constructing the approach in this way effectively reduces the risk of purchasing .The proposed approach provides flexibility to decision maker in multi-period procurement lot-sizing decisions. In other words, the purchase of any product in any period is determined as by the possibility to get closer to the goals defined in the model. It solves utilising GAMS and meta-heuristic algorithms, and analyses the efficiency of the heuristics. Efficiency of the proposed algorithm by comparing genetic algorithm in large size problems show the proposed algorithm has also better efficiency than genetic algorithm.
KW - Differential evolution algorithm
KW - Goal programming
KW - Lot sizing
KW - Shortage
UR - http://www.scopus.com/inward/record.url?scp=84915807517&partnerID=8YFLogxK
UR - https://www.inderscienceonline.com/doi/abs/10.1504/IJSOM.2015.065974
U2 - 10.1504/IJSOM.2015.065974
DO - 10.1504/IJSOM.2015.065974
M3 - Article
AN - SCOPUS:84915807517
SN - 1744-2370
VL - 20
SP - 102
EP - 117
JO - International Journal of Services and Operations Management
JF - International Journal of Services and Operations Management
IS - 1
ER -