A mobile application has been developed for selecting the most convenient underground mining method for a mine by employing well-known multi-criteria decision-making methods such as TOPSIS, VIKOR, ELECTRE, FMADM and PROMETHEE. The developed mobile application can carry out the selection process by prioritising valid alternative set of underground mining methods for taking into account some decision factors which are not considered in the conventional underground mining method selection approaches. In this way, the engineers are able to use this application for the selection of underground mining method on their mobile devices in anywhere.
Deciding on equipment from a set of feasible alternatives for excavation purpose in open pit mines is a critical task for the engineers and contractors since it considerably affects the project costs and productivity. Alternatives of rock excavation equipment, which are deemed suitable for the diggability of rock units in open pits, can have many technical specifications or factors that should be considered simultaneously. It can be successfully selected in a scientific way by employing multi-criteria decision making methods by means of taking the advantage of engineering knowledge, intuition and past experiences. In this study, we select the most convenient hydraulic excavator for a magnesite mine by fuzzy multi criteria decision making methods: fuzzy TOPSIS and fuzzy VIKOR. The fuzzy approach allows the experienced engineers to compare the multiple criteria (technical factors) and the possible alternatives of rock excavation machines by simply using linguistic expressions in their natural language.
1 December 2016 in Expert Systems with Applications
In this research, missed due date in terms of mean absolute lateness (MAL) and mean square lateness (MSL) has been considered as a performance criterion and a scheduling study has been performed to improve the missed due date performance in dynamic, stochastic, multi machine job shop environments. In the study, a new due date assignment model was proposed and a new dynamic dispatching rule was developed. The results indicate that the proposed due date assignment model is very successful for improving the missed due date performance and the developed dispatching rule is also very successful for meeting the assigned due dates.
13 August 2009 in International Journal of Production Research
This research presents a new application of greedy randomised adaptive search procedure (GRASP) to address a production sequencing problem for mixed-model assembly line in a just-in-time (JIT) production system in two different cases. In the former case, small size sequencing problems are considered and two objectives are presented; minimisation of setups and optimisation of stability of material usage rates. These two objectives are inversely correlated with each other, so simultaneous optimisation of both is challenging. This type of problem is NP-hard. The GRASP, with path relinking, searches for efficient frontier where simultaneous optimisation of number of setups and usage rates is desired. Several test problems are solved via GRASP and its performance is compared to solutions obtained via complete enumeration and simulated annealing (SA), tabu search (TS) and genetic algorithms (GA) approaches from the literature. Experimental results reveal that the GRASP with path relinking provides near-optimal solutions in terms of the two objectives and its ‘average inferiority%’ and ‘average percentile’ performances are superior to that of other heuristics. In the latter case, the goal is to explore varying the emphasis of these two conflicting objectives. Larger sequencing problems are considered and solved via GRASP with path relinking. Its objective function values are compared to the solutions obtained via a SA approach from the literature. Experimental results show that GRASP also provides good performance on large size problems and its percentage improvement is better than that of SA. Overall results also show, however, that the GRASP performs poorly with regard to CPU time.
This paper proposes a new linearized mathematical model to solve integrated cell formation and job scheduling problem. The model aims to minimize the exceptional elements, voids and the make-span of the jobs. The results of test problems show that the proposed model is very effective to obtain best solutions for small sized problems in reasonable computation times. However, due to the NP-hard nature of the considered problem, the best solutions couldn’t be obtained in acceptable times for large sized test problems whereas the real-life applications of the problem addressed here are often much larger in size. To meet the requirement of solving larger sized problems, Genetic Algorithm, which is, today, considered as one of the artificial intelligence and machine learning technique and Marine Predators Algorithm as a new and a nature-inspired metaheuristic, are proposed. The success of the algorithms was investigated and compared. The test results reveal the fact that the Marine Predators algorithm with optimized parameters has a high potential to solve real life problems. At last, an attempt is made to re-design an existing real-life production system by the proposed algorithms. Eventually, a considerable improvement is obtained on performance compared to the current situation of the system.