George Cristian Gruia and Michal Kavan
A “Greedy“ Czech Manufacturing Case
1091 - 1098
2013
7
6
International Journal of Industrial and Manufacturing Engineering
https://publications.waset.org/pdf/4775
https://publications.waset.org/vol/78
World Academy of Science, Engineering and Technology
The article describes a case study on one of Czech
Republics manufacturing middle size enterprises (ME), where due to
the European financial crisis, production lines had to be redesigned
and optimized in order to minimize the total costs of the production
of goods. It is considered an optimization problem of minimizing the
total cost of the work load, according to the costs of the possible
locations of the workplaces, with an application of the Greedy
algorithm and a partial analogy to a Set Packing Problem. The
displacement of working tables in a company should be as a onetoone
monotone increasing function in order for the total costs of
production of the goods to be at minimum. We use a heuristic
approach with greedy algorithm for solving this linear optimization
problem, regardless the possible greediness which may appear and
we apply it in a Czech ME.
Open Science Index 78, 2013