Abstract
This study discusses about scheduling of dining chair processing in a company. Products have been completed according to customer wishes. The problem is classified as flow shop scheduling problem. This paper considers a special case of a six machines of general flow shop scheduling problem which processing time of each job has the longest idle time and waiting time which causes makespan of dinning chair to be high. The goal of this problem is to minimize makespan of product processing. tabu search (TS) algorithm is used to solve this problem. Then performance of tabu search algorithm is compared with Campbell Dudek Smith (CDS) algorithm from literatures. Result shows that tabu search algorithm can improve the makespan in 1968 seconds. This result more effective compare to CDS algorithm that takes longer times 2064 seconds. Tabu search algorithm saving 4.6% makespan with the fastest computing time.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
