Multi-period Customer Service Level Maximization under Limited Production Capacity

  • Sladjan Babarogić University of Belgrade, Faculty of Organizational Sciences
  • Dragana Makajić-Nikolić
  • Danica Lečić-Cvetković
  • Nikola Atanasov

Abstract

This paper will focus on a make-to-stock multi-period order fulfilment system with random orders from different classes of customers under limited production circumstances.For this purpose a heuristic algorithm has been developed aimed at maximizing the customer service level in any cycle and in the entire multi-period. In this paper, in order to validate the results obtained with this algorithm, a mixed integer programming model was developed that is based on the same assumptions as the algorithm. The model takes into account the priorities of customer groups and the balanced customer service level within the same group. The presented approaches are applied to a real example of Fast Moving Consumer Goods. Their comparison was carried out in several scenarios. 

Author Biography

Sladjan Babarogić, University of Belgrade, Faculty of Organizational Sciences
Associate Editor in Chief of IJCCCRector of Agora University

References

[1] Cederborg O., Rudberg M., Customer Segmentation and Capable-to-Promise in aCapacity Constrained Manufacturing Environment, 16th Int. Annual EurOMA Conference,Goteborg, Sweden, 2009, http://www.iei.liu.se/prodek/forskning/iscaps/filarkiv/1.120209/CederborgandRUdbergEurOMA2009.pdf, accessed 12 January 2010.

[2] Chan F.T., Chung S.H., A Modified Multi-Criterion Genetic Algorithm for Order Fulfillmentin Manufacturing Network, Proceedings of the 9th Asia Pacific Industrial Engineering &Management System Conference, APIEMS, Indonesia, 2221-2226, 2008.

[3] Chen C., Lee W., Multi-objective optimization of multiechelon supply chain networks withuncertain product demands and prices, COMPUT. CHEM. ENG., ISSN 0098-1354, No 28:1131-1144, 2004.

[4] GLPK - GNU Linear Programming Kit. http://www.gnu.org/software/glpk, accessed 25December 2011.

[5] Lecic-Cvetkovic D., Atanasov N., Babarogic S., An Algorithm for Customer Order Fulfillmentin a Make-to-Stock Manufacturing System, INT J COMPUT COMMUN, ISSN 1841-9836, 5(5): 983-791, 2010.

[6] Lin J., Chen J.H., Enhance Order Promising with ATP Allocation Planning ConsideringMaterial and Capacity Constraints, JCIIE, ISSN 2151-7606, 22(4): 282-292, 2005.

[7] Merzifonluoglu Y., Geunes J., Uncapacitated production and location planning models withdemand fulfilment flexibility, INT J PROD ECON, ISSN 0925-5273, 102: 199-216, 2006.

[8] Meyr H., Customer Segmentation, Allocation Planning and Order Promising in Make-to-Stock Production, OR SPECTRUM, ISSN 01716468, 31(1): 229-256, 2009.

[9] Minner S., A comparison of simple heuristics for multi-product dynamic demand lot-sizingwith limited warehouse capacity, INT J PROD ECON, ISSN 0925-5273, 118: 305-310, 2009.

[10] Pochet Y.,Wolsey L.A., Production Planning by Mixed Integer Programming, Springer, 2010.

[11] Sawik T., Integer programming approach to reactive scheduling in make-to-order manufacturing,MATH COMPUT MODEL, ISSN 0895-7177, 46(11-12): 1373-1387, 2007.

[12] Xiao Y., Taaffe K., Satisfying market demands with delivery obligations or delivery charges,COMPUT OPER RES, ISSN 0305-0548, 37(2): 396-405, 2010.

[13] Xiong M.H. et al, A DSS approach to managing customer enquiries for SMEs at the customerenquiry stage, INT J PROD ECON, ISSN 0925-5273, 103(1): 332-346, 2006
File link : To download full article text in PDF format click here
Published
2012-12-01
How to Cite
BABAROGIĆ, Sladjan et al. Multi-period Customer Service Level Maximization under Limited Production Capacity. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 7, n. 5, p. 798-806, dec. 2012. ISSN 1841-9844. Available at: <http://univagora.ro/jour/index.php/ijccc/article/view/1075>. Date accessed: 04 july 2020. doi: https://doi.org/10.15837/ijccc.2012.5.1075.

Keywords

limited production capacity, customer service level, heuristic algorithm, mixed integer programming.