# Production scheduling using heuristic pour algorithm, branch and bound, and Nawaz Enscore and Ham (NEH) methods application in Butsudan industry
> Indah A.B.R.

URL kanonis: https://discover.unhas.ac.id/publications/production-scheduling-using-heuristic-pour-algorithm-branch-and-bound-and-nawaz
Jurnal / Konferensi: Iop Conference Series Earth and Environmental Science
Tahun terbit: 2020
DOI: https://doi.org/10.1088/1755-1315/575/1/012207
ISSN: 17551307
Citations: 0

## Authors
- Indah A.B.R.

## Abstract
Abstract Butsudan production companies have a major problem, namely that the production process has been delayed so that it is difficult to meet production targets on time. The problem is because the scheduling system used is not optimal. Based on these problems, the purpose of this study is to minimize the makespan value by determining the right sequence of jobs. In this study, the method used is the Heuristic Pour Algorithm, Branch and Bound, and NEH. Based on the results of the calculation using the company method, the makespan is 9.958,4 minutes, and the Heuristic Pour method is obtained by the makespan value of 9.461,1 minutes with job sequence J3-J2-J1-J4, the Branch and Bound method obtained by the makespan value of 9.717,3 minutes with job sequence J3-J1-J2-J4, the NEH method obtained the makespan result of 9.846,5 minutes with job sequence J2-J4-J1-J3. So using the proposed method can minimize makespan by 111,9 minutes to 497,3 minutes or about 8 hours.

## Keywords
- Job shop scheduling
- Heuristic
- Mathematical optimization
- Upper and lower bounds
- Sequence (biology)
- Scheduling (production processes)
- Production (economics)
- Computer science
- Value (mathematics)
- Algorithm
- Mathematics
- Chemistry
- Schedule
- Economics
- Operating system
- Biochemistry
- Machine learning
- Mathematical analysis
- Macroeconomics

---
Sumber: Discover Unhas — RIMS Universitas Hasanuddin.
Saat mengutip, gunakan DOI bila tersedia atau URL kanonis di atas.