Search

This project investigates the possibility of developing scheduling heuristic using bottleneck approach for a three machine flow shop scheduling with the tendency of dominant machine at the first process. Due to the re-entrant and permutation nature of the process routing, the actual bottlenecks were identified as M3 and it utilized makespan algorithms to identify bottleneck categories. Using these conditions, a new bottleneck based heuristic which called BB is developed and tested using Macro Programming in Microsoft Excel. The main objective of this project is to evaluate the performance of M3 bottleneck-based heuristic for M1M2M3 flow shop problems. A total of 3000 simulations were conducted using randomly data in order to evaluate the accuracy of the heuristic. The heuristic performance was evaluated for six and ten job problems. The dominance level groups are divided into levels of weak, medium and strong dominance. For each job problem, the BB results were compared against the results of complete enumeration and lower bound analysis. The results suggested that BB heuristic is very effective in solving scheduling problems within the strong P3 dominance level range. [ABSTRACT FROM AUTHOR]

This paper is aimed to identify and solve the problem faced by S. Y. Chong Foundry. A project has been assigned on this two wheel tractor. One of the problems has been found which is located on Rotavator Cover of Two Wheel Tractor that needs to take action. The issue is that the performance of the Bracket Assy. Design is not good enough causing the bolt can't withstand the force applied and lastly breakdown. The actions are based on PDCA technique and will start by identifying the root cause by using several methods which is brainstorming, Fishbone diagram, FMEA, Why-why method and structure analysis. Once all the problems are clearly understood, the following step is to come a new design. 5 ideas of new Bracket Assembly Tail Wheel generated to improve the performance of the part. Next, all the ideas will be analyzed and the collect data will be used for comparison among the idea. Lastly, using screening and scoring method to choose the best idea and propose to the owner of the foundry. The studies will end by proposing some further activity study that can be done for quality improvement on this Bracket Assembly, Tail Wheel. [ABSTRACT FROM AUTHOR]

This project investigates the possibility of developing scheduling heuristic using bottleneck approach for a four machine permutation re-entrant flow shop with the process routing of M1,M2,M3,M4,M3,M4 where M1 and M4 have high tendency of being dominant machine. Due to the re-entrant and permutation nature of the process routing, the actual bottlenecks were identified as M1 and combinations of M4+M3+M4 and it utilized two makespan algorithms to identify bottleneck categories. Each algorithm was only valid under several conditions identified as absolute bottleneck conditions. Using these conditions, a new bottleneck based heuristic which called NH is developed and tested using Macro Programming in Microsoft Excel. A total of 3000 simulations were conducted using randomly data in order to evaluate the accuracy of the heuristic. The heuristic performance was evaluated for six and ten job problems. The dominance level groups are divided into levels of weak, medium and strong dominance. For each job problem, the NH results were compared with previously developed absolute bottleneck adjacent matching (ABAM) heuristic. For six job problems, it was shown that the NH performances at medium dominance level are better than ABAM. For ten job problems, the result indicated that NH only produced better result than ABAM at the strong dominance level. [ABSTRACT FROM AUTHOR]