Open AccessProduction scheduling using heuristic pour algorithm, branch and bound, and Nawaz Enscore and Ham (NEH) methods application in Butsudan industry
Author(s) -
A. Besse Riyani Indah,
Sapta Asmal,
Saiful Mangngenre,
T. N. Istiqa
Publication year - 2020
Publication title -
iop conference series. earth and environmental science
Language(s) - English
Resource type - Journals
eISSN - 1755-1307
pISSN - 1755-1315
DOI - 10.1088/1755-1315/575/1/012207
Subject(s) - 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 , mathematical analysis , biochemistry , machine learning , macroeconomics , operating system
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.