Optimizing Production Scheduling Using Genetic Algorithm Case Study in PT. Kurnia Ratu Kencana
This thesis addresses the scheduling problem in PT Kurnia Ratu Kencana with scope of problem in production scheduling system. in this factory, the product completion time often exceeds the agreed deadline. the cause of the problem is the total makespan, that is the total time from the first item enters the production line until the last item leaves the production line in the same batch, was too high. Therefore the purpose is to develop an application that is able to generate production schedules with minimum total makespan. Genetic algorithm as a proposed methodology should be able to deliver a solution with possible minimum total makespan. the best solution is selected using roulette wheel methods, mutation and crossover processes. an application is developed using java programming to generate production schedules in a flow shop factory. the resulting application is capable of automatically creates production schedules that has better total makespan compared to previous scheduling method used in PT Kurnia Ratu Kencana. Genetic algorithm is capable of create a production schedule in PT KRK with smaller total makespan in shorter time.
|B01600||(Rack Thesis)||Available but not for loan - Missing|
No other version available