Variable Neighborhoods Search for Multi-Site Production Planning

Author

Agung Mustika Rizki, Gusti Eka Yuliastuti, Wayan Firdaus Mahmudy, Ishardita Pambudi Tama

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.

Full Text:

PDF

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.




DOI: http://dx.doi.org/10.25126/jitecs.20183265