MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM
Batik Murni is one of the Small and Medium Enterprises (SMEs) in Madiun that produces batik tulis and batik cap. This SMEs still uses intuition to make the production schedule. This condition can give disadventages for the SMEs, overstock and stockout will be happened. In this study, the researchers...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitas Ahmad Dahlan
2020-04-01
|
Series: | Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri |
Subjects: | |
Online Access: | http://journal.uad.ac.id/index.php/Spektrum/article/view/15869 |
_version_ | 1818175283903070208 |
---|---|
author | Wildanul Isnaini Emylia Arghawaty Zahrul Ashari |
author_facet | Wildanul Isnaini Emylia Arghawaty Zahrul Ashari |
author_sort | Wildanul Isnaini |
collection | DOAJ |
description | Batik Murni is one of the Small and Medium Enterprises (SMEs) in Madiun that produces batik tulis and batik cap. This SMEs still uses intuition to make the production schedule. This condition can give disadventages for the SMEs, overstock and stockout will be happened. In this study, the researchers want to offer a solution for the scheduling problems so Batik Murni can increase their productivity performance. Researchers offer three production scheduling methods aim to minimize the makespan of Batik Tulis. Makespan is used as a parameter in this study because when it can be minimized so the each time (processing time, setup time, flow time, ect) in the workstation can be minimized too. In this case, the best method that have the minimum makespan has the important role to know when the job can be started and ended. The three methods used are Palmer, Champbell Dukdek Smith (CDS), and Heuristic Pour Algorithm. From this research, it can be concluded that the best production scheduling optimization at Batik Murni SMEs is obtained from the Palmer method. With makespan of 4837 minutes or 11 days so the makespan can be minimized 54,2%. In the order of the production process is batik sejuta bunga – batik batik turi tabur - batik seger arum - batik pecel. |
first_indexed | 2024-12-11T19:57:50Z |
format | Article |
id | doaj.art-4f085fc1c5b4467db60fcd04d273fe26 |
institution | Directory Open Access Journal |
issn | 1693-6590 2442-2630 |
language | English |
last_indexed | 2024-12-11T19:57:50Z |
publishDate | 2020-04-01 |
publisher | Universitas Ahmad Dahlan |
record_format | Article |
series | Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri |
spelling | doaj.art-4f085fc1c5b4467db60fcd04d273fe262022-12-22T00:52:36ZengUniversitas Ahmad DahlanSpektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri1693-65902442-26302020-04-0118195101http://dx.doi.org/10.12928/si.v18i1.15869MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHMWildanul Isnaini0Emylia Arghawaty1Zahrul Ashari2Program Studi Teknik Industri, Fakultas Teknik, Universitas PGRI MadiunProgram Studi Teknik Industri, Fakultas Teknik, Universitas PGRI MadiunProgram Studi Teknik Industri, Fakultas Teknik, Universitas PGRI MadiunBatik Murni is one of the Small and Medium Enterprises (SMEs) in Madiun that produces batik tulis and batik cap. This SMEs still uses intuition to make the production schedule. This condition can give disadventages for the SMEs, overstock and stockout will be happened. In this study, the researchers want to offer a solution for the scheduling problems so Batik Murni can increase their productivity performance. Researchers offer three production scheduling methods aim to minimize the makespan of Batik Tulis. Makespan is used as a parameter in this study because when it can be minimized so the each time (processing time, setup time, flow time, ect) in the workstation can be minimized too. In this case, the best method that have the minimum makespan has the important role to know when the job can be started and ended. The three methods used are Palmer, Champbell Dukdek Smith (CDS), and Heuristic Pour Algorithm. From this research, it can be concluded that the best production scheduling optimization at Batik Murni SMEs is obtained from the Palmer method. With makespan of 4837 minutes or 11 days so the makespan can be minimized 54,2%. In the order of the production process is batik sejuta bunga – batik batik turi tabur - batik seger arum - batik pecel.http://journal.uad.ac.id/index.php/Spektrum/article/view/15869schedulingmakespanpalmercdsheuristic pour algorithm |
spellingShingle | Wildanul Isnaini Emylia Arghawaty Zahrul Ashari MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri scheduling makespan palmer cds heuristic pour algorithm |
title | MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM |
title_full | MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM |
title_fullStr | MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM |
title_full_unstemmed | MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM |
title_short | MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM |
title_sort | makespan minimization in batik murni smes with palmer campbell dukdek smith and heuristic pour algorithm |
topic | scheduling makespan palmer cds heuristic pour algorithm |
url | http://journal.uad.ac.id/index.php/Spektrum/article/view/15869 |
work_keys_str_mv | AT wildanulisnaini makespanminimizationinbatikmurnismeswithpalmercampbelldukdeksmithandheuristicpouralgorithm AT emyliaarghawaty makespanminimizationinbatikmurnismeswithpalmercampbelldukdeksmithandheuristicpouralgorithm AT zahrulashari makespanminimizationinbatikmurnismeswithpalmercampbelldukdeksmithandheuristicpouralgorithm |