Job shop scheduling using shifting bottleneck heuristic algorithm

Tamtomo, B. T. and Kurniawati, D. A. and Yusof, N. M. and Wong, K. Y. (2021) Job shop scheduling using shifting bottleneck heuristic algorithm. In: 11th Annual International Conference on Industrial Engineering and Operations Management, IEOM 2021, 7 March 2021 - 11 March 2021, Virtual, Online.

Full text not available from this repository.

Official URL: https://www.scopus.com

Abstract

Production scheduling is defined as allocating limited resources to do several jobs. PT. Hari Mukti Teknik is a company engaged in manufacturing and engineering in Indonesia. The company implements an FCFS scheduling system with make to order and job shop production system. In order to produce a schedule that is efficient and feasible for the production process in the company, it is necessary to carry out further research on the production scheduling process using the heuristic method. The proposed method is Shifting Bottleneck Heuristic algorithm. This method can determine which machines are experiencing bottlenecks so that the scheduling results in better job sequences and produces a smaller makespan. The current method results in the makespan of 603 hours, while the Shifting Bottleneck Heuristic algorithm has smaller makespan, that is 468.71 hours. The proposed method produces better results than the company's existing method, where EI is 1.287 and RE is -28.651% based on the performance evaluation with EI and RE parameters. Therefore, the Shifting Bottleneck Heuristic algorithm is a better method and can be applied by the company to minimize the makespan.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:job shop, makespan, scheduling
Subjects:T Technology > TJ Mechanical engineering and machinery
Divisions:Mechanical Engineering
ID Code:95831
Deposited By: Narimah Nawil
Deposited On:19 Jun 2022 12:39
Last Modified:19 Jun 2022 12:39

Repository Staff Only: item control page