Muhamad Hafiz Masran
Thumbnail Image
Preferred name
Muhamad Hafiz Masran
Official Name
Muhamad Hafiz , Masran
Alternative Name
Masran, H.
Masran, Muhamad Hafiz
Main Affiliation
Scopus Author ID
58352700900
Researcher ID
ABA-2767-2021

Research Output

Filters

1 1
5
Reset filters

Settings
Now showing 1 - 5 of 5
Thumbnail Image
Publication

Minimization of Bottleneck and Workstations for Assembly Line Balancing Problem in Power Transformer Manufacturing Using Heuristics

2019-04-11 , Bakar N.A. , Ramli M.F. , Zakaria M.Z. , Sin T.C. , Muhamad Hafiz Masran

This project deals with a case study of SALBP in power transformer manufacturing. Some workstations in assembly line experienced bottlenecks, while the others suffered with high idle time. Therefore, four heuristic methods are chosen in order to provide solutions for minimizing number of workstations and improve the bottlenecks simultaneously. In this study, LCR, RPW and LPT are successfully minimized number of workstation from 19 to 16 workstations. Consequently, these solutions affect the layout. On the contrary, SPT able to improve the bottleneck by reducing number of workstations from 19 to 17 without affect the line layout. Therefore, this has created an option for engineer to decide which decision should be implement to the assembly line due to enhance the line efficiency.

View
Thumbnail Image
Publication

A review on the modelling of collection and distribution of blood donation based on vehicle routing problem

2017-11-22 , Nur Arif Azezan , Mohammad Fadzli Ramli , Muhamad Hafiz Masran

In this paper, we discussed a literature on blood collection-distribution that based on vehicle routing problem. This problem emergence when the process from collection to stock up must be completed in timely manner. We also modified the mathematical model so that it will suited to general collection of blood. A discussion on its algorithm and solution methods are also pointed out briefly in this paper.

View
Thumbnail Image
Publication

Heuristic method for the modified model of capacitated arc routing problems

2015 , Muhamad Hafiz Masran

The management of waste collection in urban areas is a critical issue for some developing countries especially in Malaysia which requires immediate attention. This study attempts to make an analysis and assessment of the development of the Perlis state waste generation distribution and the optimization of waste collection routes. This thesis describes the architecture design of the mathematical modeling for the mixed graph of Capacitated Arc Routing Problem (MCARP) extended from the Capacitated Arc Routing Problem (CARP). Furthermore, it provides a description of several equations that can be used to obtain efficient collection routes such as capacity vehicles constraint. To get the better result, this study used the existing heuristics method for solving MCARP mathematical modeling. The result shows that the total costs produced are considerably acceptable and are also reasonably improved, although the existing heuristics method do not obtain an optimal solution but in term of the computational time is good and better than other methods for small and intermediate networks especially in the mixed graph problem

View
No Thumbnail Available
Publication

Soft computing for hazardous waste routing in Malaysia: a review

2023 , Muhamad Hafiz Masran , Syariza Abdul Rahman , Wan Nor Munirah Ariffin

Nowadays, a significant number of researchers are focusing on utilizing soft computing approaches to address the issue of scheduling in applications concerned with hazardous waste management. In Malaysia, there is thoughtless awareness of the management of hazardous waste, even though the production of wastes in hazardous domains at the industrial and domestic levels has been rising lately. According to previous research findings, the location routing problem (LRP) can be designated as one of the models closer to the actual situation, evaluating the most suitable and optimal location for establishing facilities and utilizing transportation for pick-up and distribution. Recent studies have focused on enhancing the LRP model, and its methodologies approach to solve the waste management problem in hazardous domains. In this paper, a comprehensive review of the better promising and practicable mathematical model of LRP and its methodology approach is discussed, as well as an analysis of the publishing pattern and the trend of research over the preceding five years and more, as retrieved from the web of science (WoS) database. In conclusion, this research is significant in ensuring the effectiveness of reliable mathematical model development and suitable methodologies in the future for solving hazardous waste management problems.

View
No Thumbnail Available
Publication

Product pairing selection for promotion using partitioning method

2023 , Wan Nor Munirah Ariffin , Raveena Subramaniam , Erni Puspanantasari Putri , Muhammad Shahar Jusoh , Muhamad Hafiz Masran , Mohamad Nur Khairul Hafizi Rohani , Yussof Hussin , Noormaizatul Akmar Ishak , Emy Aizat Azimi , Siti Sharina Mohd Shukri

Slow-moving product is harmful to the business. The slow-moving products take up space and tie up the company’s capital and leave the company with fewer funds to invest in its business. Several factors can cause this issue. There are several methods ranging from statistics to heuristic methods for a company to identify slow-moving inventory but all of them rely on data. In this paper, a partitioning technique from the graph network is proposed to partition the inventories or products into a few clusters. It can help the company to identify what group does the product belongs to and at the same time suggest to the company which product can be paired up or bundled up together to clear up aging and slow-moving products. The partition technique is proposed, and the algorithm is coded using the Visual C++ programming language. The simulation results show that the proposed method can partition the task graph onto smaller subgraphs. The subgraphs called cluster consists of the nodes or products with similar purchase volume (the strong connection between the two nodes). Implementing the partitioning technique could help the companies or managers select the appropriate product to be paired together when doing the promotion.

View