The Proposed of Table and Chair Production Scheduling Using Simulated Annealing Algorithm for Minimizing Makespan in PT. Citra Bandung Laksana

Suhandi, Victor and Santoso, Santoso and Wijaya, Iwan (2009) The Proposed of Table and Chair Production Scheduling Using Simulated Annealing Algorithm for Minimizing Makespan in PT. Citra Bandung Laksana. In: International Seminar on Industrial Engineering and Management, December 10th-11th, 2009, Bali.

[img]
Preview
Text
Isiem 2009 b.pdf - Published Version

Download (5Mb) | Preview

Abstract

PT. Citra Bandung Laksana is a manufacturing company on a national scale that produces various kinds of chair and table. In order to win the competition, the company has two kinds of production system which is Make to Stock system and Make to Order system. The problem faced by the company is the high level of delay from the machine that used in Make to Order system so deliver the low level of machine utilization. Based on observation, it cause by the company's method scheduling is not yet appropriate. The company collects the order for one week and works it from the first coming order until finish. We suggest to use two alternative schedule methods, which are simulated annealing algorithm and non-delay schedule to find out the best method to reduce machine delay with the lowest makespan. From a given six example case, simulated annealing algorithm gives the best result with the lowest makespan, the lowest machine delay, and the high level of machine utilization. Finally, we suggests the company to use simulated annealing algorithm as a new schedule methods and also develops simulated annealing software for a job shop case to get faster calculation with an accurate result. The company's schedule problem solves by the company's method scheduling itself compare with simulated annealing algorithm. The company's method scheduling gives makespan for 6,454 minutes with average machine delay for 5,565,333 minutes and average machine utilization for 13.77%. Meanwhile, we suggests working the order together without waiting the first order done. Simulated annealing algorithm gives makespan for 5,632 minutes with average machine delay for 4,743.333 minutes and average machine utilization for 15.78%. The benefits of using simulated annealing algorithm are the company can reduce makespan to 822 minutes (12.74%) with decreasing average machine delay to 822 minutes (14.77%) and increasing machine utilization to 2.01%. Otherwise, the company can do the other order early.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: scheduling,jobshop, delay, makespan, simulated annealing
Subjects: T Technology > T Technology (General)
Depositing User: Perpustakaan Maranatha
Date Deposited: 23 Aug 2016 05:44
Last Modified: 23 Aug 2016 05:44
URI: http://repository.maranatha.edu/id/eprint/20848

Actions (login required)

View Item View Item