Variable Neighborhoods Search for Multi-Site Production Planning | Zendy

Agung Mustika Rizki | Zendy; Gusti Eka Yuliastuti | Zendy; Wayan Firdaus Mahmudy | Zendy; Ishardita Pambudi Tama | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Variable Neighborhoods Search for Multi-Site Production Planning

Author(s) -

Agung Mustika Rizki,

Gusti Eka Yuliastuti,

Wayan Firdaus Mahmudy,

Ishardita Pambudi Tama

Publication year - 2018

Publication title -

journal of information technology and computer science

Language(s) - English

Resource type - Journals

eISSN - 2540-9824

pISSN - 2540-9433

DOI - 10.25126/jitecs.20183265

Subject(s) - production (economics) , production planning , variable (mathematics) , order (exchange) , computer science , operations research , business , operations management , variable neighborhood search , mathematical optimization , engineering , economics , mathematics , microeconomics , algorithm , finance , mathematical analysis , metaheuristic

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research