Multi-period Customer Service Level Maximization under Limited Production Capacity

Sladjan Babarogić, 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.

 


Keywords


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

Full Text:

PDF

References


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.

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.

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.

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

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.

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.

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

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

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.

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

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.

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

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




DOI: https://doi.org/10.15837/ijccc.2012.5.1075



Copyright (c) 2017 Sladjan Babarogić, Dragana Makajić-Nikolić, Danica Lečić-Cvetković, Nikola Atanasov

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.