IMPLEMENTASI ALGORITMA MIGRATING BIRDS OPTIMIZATION PADA PENYELESAIAN MASALAH HYBRID FLOWSHOP SCHEDULING

Ilma Nur Amalia Hasanah, - (2024) IMPLEMENTASI ALGORITMA MIGRATING BIRDS OPTIMIZATION PADA PENYELESAIAN MASALAH HYBRID FLOWSHOP SCHEDULING. S1 thesis, Universitas Pendidikan Indonesia.

	Text S_MAT_2003898_Title.pdf Download (1MB)
	Text S_MAT_2003898_Chapter1.pdf Download (150kB)
	Text S_MAT_2003898_Chapter2.pdf Restricted to Staf Perpustakaan Download (380kB)
	Text S_MAT_2003898_Chapter3.pdf Download (600kB)
	Text S_MAT_2003898_Chapter4.pdf Restricted to Staf Perpustakaan Download (524kB)
	Text S_MAT_2003898_Chapter5.pdf Download (165kB)
	Text S_MAT_2003898_Appendix.pdf Restricted to Staf Perpustakaan Download (265kB)

Abstract

Implementasi Algoritma Migrating Birds Optimization (MBO) untuk menyelesaikan masalah Hybrid Flowshop Scheduling (HFS) merupakan fokus penelitian ini. HFS adalah suatu masalah penjadwalan produksi yang melibatkan beberapa tahapan produksi dengan setidaknya satu tahap yang mengoperasikan mesin serupa secara paralel. HFS diselesaikan untuk menghasilkan penjadwalan produksi yang meminimumkan waktu penyelesaian proses terakhir (makespan). Penyelesaian masalah HFS menggunakan Algoritma MBO dilakukan dengan cara menginisialisasi parameter, yaitu jumlah populasi, solusi tetangga, nilai sharing, dan iterasi maksimum. Setiap solusi dievaluasi berdasarkan makespan. Selanjutnya, pembangkitan solusi tetangga dilakukan melalui swapping permutation dan mengevaluasi ulang makespan dari solusi tetangga. Berdasarkan evaluasi tersebut, pemimpin atau solusi terbaik diperbarui. Proses ini berulang hingga iterasi maksimum tercapai. Hasil implementasi menunjukkan bahwa algortima MBO berhasil memberikan solusi masalah penjadwalan produksi di suatu pabrik tekstil dengan makespan yang minimum. The implementation of Migrating Birds Optimization (MBO) Algorithm to solve the Hybrid Flowshop Scheduling (HFS) problem is the focus of this research. HFS is a production scheduling issue that involves several production stages, with at least one stage operating similar machines in parallel. HFS is solved to generate a production schedule that minimizes the completion time of the final process (makespan). The solution of the HFS problem using the MBO algorithm is carried out by initializing parameters, namely population size, neighbor solutions, sharing value, and maximum iterations. Each solution is evaluated based on the makespan. Next, the generation of neighboring solutions is performed through swapping permutation and re-evaluating the makespan of the neighboring solutions. Based on this evaluation, the leader or the best solution is updated. This process is repeated until the maximum number of iterations is reached. The results of the implementation show that the MBO algorithm successfully provides a solution to the production scheduling problem in a textile factory with a minimum makespan.

Item Type:	Thesis (S1)
Additional Information:	https://scholar.google.com/citations?hl=en&user=6QvNr7QAAAAJ ID SINTA Dosen Pembimbing: Endang Cahya Mulyaning A: 6121877 Khusnul Novianingsih: 258640
Uncontrolled Keywords:	Hybrid flowshop, Penjadwalan, Algoritma Migrating Birds Optimization, Optimisasi, Makespan. Hybrid flowshop, Scheduling, Migrating Birds Optimization Algorithm, Optimization, Makespan.
Subjects:	Q Science > QA Mathematics
Divisions:	Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User:	Ilma Nur Amalia Hasanah
Date Deposited:	05 Aug 2024 08:46
Last Modified:	05 Aug 2024 08:46
URI:	http://repository.upi.edu/id/eprint/119641

Actions (login required)

View Item