Comparative study of Pareto, Knapsack and Greedy Algorithm in the field of industrial Maintenance [ READ ]
Amal Boukili, Mohamed Fri, Mohammed El Hammoumi, Fouad Belmajdoub
In this paper, we have compared these three methods (Pareto, Knapsack problem (KP) and Greedy Algorithm) in order to deduce which among them is the most effective. The purpose of this study is to remedy halts and unforeseen breakdowns on chains of production as well as to increase the efficiency of production, which is the major concern of the industry leaders. The choice of method of maintenance management directly affects the stability of the productivity and the cost of maintenance actions. We will compare the results obtained from these three methods: Pareto, which is widely used in the maintenance; Knapsack Problem, which is widely used in Freight management; and Greedy Algorithm, which is used in scheduling.
Amal Boukili, Mohamed Fri, Mohammed El Hammoumi, Fouad Belmajdoub
In this paper, we have compared these three methods (Pareto, Knapsack problem (KP) and Greedy Algorithm) in order to deduce which among them is the most effective. The purpose of this study is to remedy halts and unforeseen breakdowns on chains of production as well as to increase the efficiency of production, which is the major concern of the industry leaders. The choice of method of maintenance management directly affects the stability of the productivity and the cost of maintenance actions. We will compare the results obtained from these three methods: Pareto, which is widely used in the maintenance; Knapsack Problem, which is widely used in Freight management; and Greedy Algorithm, which is used in scheduling.
