Job shop scheduling using shifting bottleneck heuristic algorithm

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 sch...

Full description

Saved in:
Bibliographic Details
Main Authors: Tamtomo, B. T., Kurniawati, D. A., Yusof, N. M., Wong, K. Y.
Format: Conference or Workshop Item
Published: 2021
Subjects:
Online Access:http://eprints.utm.my/id/eprint/95831/
https://www.scopus.com
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.95831
record_format eprints
spelling my.utm.958312022-06-19T04:39:39Z http://eprints.utm.my/id/eprint/95831/ Job shop scheduling using shifting bottleneck heuristic algorithm Tamtomo, B. T. Kurniawati, D. A. Yusof, N. M. Wong, K. Y. TJ Mechanical engineering and machinery 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. 2021 Conference or Workshop Item PeerReviewed 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. https://www.scopus.com
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic TJ Mechanical engineering and machinery
spellingShingle TJ Mechanical engineering and machinery
Tamtomo, B. T.
Kurniawati, D. A.
Yusof, N. M.
Wong, K. Y.
Job shop scheduling using shifting bottleneck heuristic algorithm
description 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.
format Conference or Workshop Item
author Tamtomo, B. T.
Kurniawati, D. A.
Yusof, N. M.
Wong, K. Y.
author_facet Tamtomo, B. T.
Kurniawati, D. A.
Yusof, N. M.
Wong, K. Y.
author_sort Tamtomo, B. T.
title Job shop scheduling using shifting bottleneck heuristic algorithm
title_short Job shop scheduling using shifting bottleneck heuristic algorithm
title_full Job shop scheduling using shifting bottleneck heuristic algorithm
title_fullStr Job shop scheduling using shifting bottleneck heuristic algorithm
title_full_unstemmed Job shop scheduling using shifting bottleneck heuristic algorithm
title_sort job shop scheduling using shifting bottleneck heuristic algorithm
publishDate 2021
url http://eprints.utm.my/id/eprint/95831/
https://www.scopus.com
_version_ 1736833512829353984
score 13.187197