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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Adhie Tri Wahyudi, Bagus Ismail Adhi Wicaksana, Maresta Andriani
Formato:	article
Lenguaje:	EN ID
Publicado:	LPPM Universitas Katolik Parahyangan 2021
Materias:	production scheduling, job shop, muti-machines, non – delay algorithm Industrial engineering. Management engineering T55.4-60.8
Acceso en línea:	https://doaj.org/article/18188d42e5eb4e359fe35473d5933039
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:18188d42e5eb4e359fe35473d5933039
record_format	dspace
spelling	oai:doaj.org-article:18188d42e5eb4e359fe35473d59330392021-11-09T02:44:06ZPenjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan0216-10362339-149910.26593/jrsi.v10i2.4666.183-190https://doaj.org/article/18188d42e5eb4e359fe35473d59330392021-10-01T00:00:00Zhttps://journal.unpar.ac.id/index.php/jrsi/article/view/4666https://doaj.org/toc/0216-1036https://doaj.org/toc/2339-1499Scheduling 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.Adhie Tri WahyudiBagus Ismail Adhi WicaksanaMaresta AndrianiLPPM Universitas Katolik Parahyanganarticleproduction scheduling, job shop, muti-machines, non – delay algorithm Industrial engineering. Management engineeringT55.4-60.8ENIDJurnal Rekayasa Sistem Industri, Vol 10, Iss 2, Pp 183-190 (2021)
institution	DOAJ
collection	DOAJ
language	EN ID
topic	production scheduling, job shop, muti-machines, non – delay algorithm Industrial engineering. Management engineering T55.4-60.8
spellingShingle	production scheduling, job shop, muti-machines, non – delay algorithm Industrial engineering. Management engineering T55.4-60.8 Adhie Tri Wahyudi Bagus Ismail Adhi Wicaksana Maresta Andriani Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan
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.
format	article
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
title	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_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_sort	penjadwalan produksi job shop mesin majemuk menggunakan algoritma non delay untuk meminimalkan makespan
publisher	LPPM Universitas Katolik Parahyangan
publishDate	2021
url	https://doaj.org/article/18188d42e5eb4e359fe35473d5933039
work_keys_str_mv	AT adhietriwahyudi penjadwalanproduksijobshopmesinmajemukmenggunakanalgoritmanondelayuntukmeminimalkanmakespan AT bagusismailadhiwicaksana penjadwalanproduksijobshopmesinmajemukmenggunakanalgoritmanondelayuntukmeminimalkanmakespan AT marestaandriani penjadwalanproduksijobshopmesinmajemukmenggunakanalgoritmanondelayuntukmeminimalkanmakespan
_version_	1718441364783366144

Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan

Ejemplares similares