Variable Neighborhoods Search for Multi-Site Production Planning

Authors

  • Agung Mustika Rizki Brawijaya University
  • Gusti Eka Yuliastuti Brawijaya University
  • Wayan Firdaus Mahmudy Brawijaya University
  • Ishardita Pambudi Tama Brawijaya University

DOI:

https://doi.org/10.25126/jitecs.20183265

Abstract

In the home textile industry, production planning needs to be done so that the production costs incurred by the company can be well controlled. Production planning is a problem that cannot be solved in a short time. Problems are more complex if the company has several production branches in other cities, with rules and standards that are certainly very different from one city to another. Based on this background, an algorithm is needed that can solve production planning problems for companies with many production branches in order to obtain optimal solutions. VNS is applied by the author and produces an optimal and efficient solution because the time needed is relatively short compared to the planning carried out previously by the company.

References

O. Saracoglu, M. C. Arslan, and M. Turkay, “Aggregate Planning Problem from Sustainability Perspective,†Int. Conf. Adv. Logist. Transp. Aggreg., pp. 181–186, 2015.

L. Xu, S. Weiping, and H. Ming, “Flexible Job Shop Scheduling Based on Multi-Population Genetic-Variable Neighborhood Search Algorithm,†in International Conference on Computer Science and Network Technology (ICCSNT), 2015, vol. 1, no. Iccsnt, pp. 244–248.

M. F. Tasgetiren, Q. K. Pan, D. Kizilay, and G. Suer, “A Differential Evolution Algorithm with Variable Neighborhood Search for Multidimensional Knapsack Problem,†IEEE Congr. Evol. Comput., pp. 2797–2804, 2015.

K. Ghorbani-moghadam, R. Ghanbari, and N. Mahdavi-amiri, “Solving Fuzzy Number Linear Programming Problems using A Variable Neighborhood Search Algorithm,†in Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS) Solving, 2018, no. 1, pp. 31–33.

W. J. Stevenson and S. C. Chuong, Manajemen Operasi: Perspektif ASia, Edisi 9. Jakarta: Salemba Empat, 2014.

W. F. Mahmudy, “Optimization of Part Type Selection and Machine Loading Problems in Flexible Manufacturing System Using Variable Neighborhood Search,†IAENG Int. J. Comput. Sci., no. July, 2015.

N. Mladenović, R. Todosijević, and D. Urošević, “An efficient GVNS for solving Traveling Salesman Problem with Time Windows,†Electron. Notes Discret. Math., vol. 39, pp. 83–90, 2012.

P. Hansen and N. Mladenović, “Variable Neighborhood Search: Principles and Applications,†Eur. J. Oper. Res., vol. 130, no. 3, pp. 449–467, 2001.

Downloads

Published

2018-11-05

How to Cite

Rizki, A. M., Yuliastuti, G. E., Mahmudy, W. F., & Tama, I. P. (2018). Variable Neighborhoods Search for Multi-Site Production Planning. Journal of Information Technology and Computer Science, 3(2), 169–174. https://doi.org/10.25126/jitecs.20183265

Issue

Vol. 3 No. 2: November 2018

Section

Articles

License

Creative Commons License Creative Common Attribution-ShareAlike 3.0 International (CC BY-SA 3.0)

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).