Optimization of Flow Shop Scheduling Problem using Tabu Search Algorithm: A Case Study

1st South Aceh International Conference on Engineering and Technology

工业技术（总论）

Dewi, S.S.^1 ; Andriansyah, A.^1^2 ; Syahriza, S.^1

Industrial Engineering Department, Faculty of Engineering, Universitas Syiah Kuala, Darussalam, Banda Aceh

23114, Indonesia^1

Laboratory of Industrial Computation and Optimization, Universitas Syiah Kuala, Darussalam, Banda Aceh

23114, Indonesia^2

关键词: Computing time;    Customer wishes;    Flow shop scheduling problem;    Idle time;    Processing time;    Product processing;    Tabu search algorithms;    Waiting-time;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/506/1/012064/pdf
DOI  :  10.1088/1757-899X/506/1/012064

学科分类：工业工程学

来源: IOP

【 摘 要 】

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.