Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan
Scheduling is an important factor in both manufacturing and service industry environments. Scheduling is a resource allocation arrangement for completing tasks that involve work, resources and time. With the scheduling, all work can be completed according to priority and can minimize processing time...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
LPPM Universitas Katolik Parahyangan
2021-10-01
|
| Series: | Jurnal Rekayasa Sistem Industri |
| Subjects: | |
| Online Access: | https://journal.unpar.ac.id/index.php/jrsi/article/view/4666 |
| _version_ | 1818823393501249536 |
|---|---|
| author | Adhie Tri Wahyudi Bagus Ismail Adhi Wicaksana Maresta Andriani |
| author_facet | Adhie Tri Wahyudi Bagus Ismail Adhi Wicaksana Maresta Andriani |
| author_sort | Adhie Tri Wahyudi |
| collection | DOAJ |
| description | Scheduling is an important factor in both manufacturing and service industry environments. Scheduling is a resource allocation arrangement for completing tasks that involve work, resources and time. With the scheduling, all work can be completed according to priority and can minimize processing time, so that makespan is minimal. In addition, it can reduce idle machines and reduce the inventory of semi-finished goods. Maryati Small Micro and Medium Enterprises (IKM) is a business that is engaged in the manufacture of clothing that produces various types of products such as baby clothes, teenage clothes to adults. So far, IKM Maryati is in the process of machine scheduling by determining the order of Job execution based on the longest to shortest total Job processing time. Scheduling with this method creates problems for the company, as evidenced by the accumulation of semi-finished goods at several work-stations. Another problem is when orders arrive at a certain period with a large variety and number of products, causing Job completion that exceeds the target time (due-date). The size of the makespan causes the production time to increase, so the company is late to start production of orders in the following month. In this study, the Non-delay algorithm is used to solve the problems that arise in IKM Maryati. The result obtained is the scheduling using the existing method by IKM Maryati which produces 44 days makespan value. Meanwhile, by applying the Non-delay compound engine algorithm, it produces a makespan of 42 days. This shows that the compound machine Non-delay Algorithm method can minimize the makespan value in IKM Maryati. There is an efficiency of 4.55% in both time and cost variables. |
| first_indexed | 2024-12-18T23:39:16Z |
| format | Article |
| id | doaj.art-18188d42e5eb4e359fe35473d5933039 |
| institution | Directory Open Access Journal |
| issn | 0216-1036 2339-1499 |
| language | English |
| last_indexed | 2024-12-18T23:39:16Z |
| publishDate | 2021-10-01 |
| publisher | LPPM Universitas Katolik Parahyangan |
| record_format | Article |
| series | Jurnal Rekayasa Sistem Industri |
| spelling | doaj.art-18188d42e5eb4e359fe35473d59330392022-12-21T20:47:25ZengLPPM Universitas Katolik ParahyanganJurnal Rekayasa Sistem Industri0216-10362339-14992021-10-0110218319010.26593/jrsi.v10i2.4666.183-1904199Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan MakespanAdhie Tri Wahyudi0https://orcid.org/0000-0003-3149-0463Bagus Ismail Adhi Wicaksana1Maresta Andriani2Universitas Setia BudiUniversitas Setia BudiUniversitas Setia BudiScheduling is an important factor in both manufacturing and service industry environments. Scheduling is a resource allocation arrangement for completing tasks that involve work, resources and time. With the scheduling, all work can be completed according to priority and can minimize processing time, so that makespan is minimal. In addition, it can reduce idle machines and reduce the inventory of semi-finished goods. Maryati Small Micro and Medium Enterprises (IKM) is a business that is engaged in the manufacture of clothing that produces various types of products such as baby clothes, teenage clothes to adults. So far, IKM Maryati is in the process of machine scheduling by determining the order of Job execution based on the longest to shortest total Job processing time. Scheduling with this method creates problems for the company, as evidenced by the accumulation of semi-finished goods at several work-stations. Another problem is when orders arrive at a certain period with a large variety and number of products, causing Job completion that exceeds the target time (due-date). The size of the makespan causes the production time to increase, so the company is late to start production of orders in the following month. In this study, the Non-delay algorithm is used to solve the problems that arise in IKM Maryati. The result obtained is the scheduling using the existing method by IKM Maryati which produces 44 days makespan value. Meanwhile, by applying the Non-delay compound engine algorithm, it produces a makespan of 42 days. This shows that the compound machine Non-delay Algorithm method can minimize the makespan value in IKM Maryati. There is an efficiency of 4.55% in both time and cost variables.https://journal.unpar.ac.id/index.php/jrsi/article/view/4666production scheduling, job shop, muti-machines, non – delay algorithm |
| spellingShingle | Adhie Tri Wahyudi Bagus Ismail Adhi Wicaksana Maresta Andriani Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan Jurnal Rekayasa Sistem Industri production scheduling, job shop, muti-machines, non – delay algorithm |
| title | Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan |
| title_full | Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan |
| title_fullStr | Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan |
| title_full_unstemmed | Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan |
| title_short | Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan |
| title_sort | penjadwalan produksi job shop mesin majemuk menggunakan algoritma non delay untuk meminimalkan makespan |
| topic | production scheduling, job shop, muti-machines, non – delay algorithm |
| url | https://journal.unpar.ac.id/index.php/jrsi/article/view/4666 |
| work_keys_str_mv | AT adhietriwahyudi penjadwalanproduksijobshopmesinmajemukmenggunakanalgoritmanondelayuntukmeminimalkanmakespan AT bagusismailadhiwicaksana penjadwalanproduksijobshopmesinmajemukmenggunakanalgoritmanondelayuntukmeminimalkanmakespan AT marestaandriani penjadwalanproduksijobshopmesinmajemukmenggunakanalgoritmanondelayuntukmeminimalkanmakespan |