Syarif, Admi and Wamiliana, Wamiliana and Lumbanraja, Jamalam (2020) Study on genetic algorithm (GA) approaches for solving Flow Shop Scheduling Problem (FSSP). iops.

Preview

Text Syarif_2020_IOP_Conf._Ser.__Mater._Sci._Eng._857_012009.pdf Download (592kB) | Preview

Abstract

Abstract. The scheduling problem is known as one of the well-known optimization problems. It occurs in many situations of our daily-life applications, especially in industrial fields. One type of scheduling problem is called Flow Shop Scheduling Problem (FSSP). It belongs to the class of NP-complete problem. During the last decades, researches on exploring more accurate and efficient heuristic methods to solve hard optimization problems have taken considerable attention from researchers. Among them, GA has been one of the powerful and widely used algorithms. In this paper, we present two GA approaches to solve FSSP. The main objective is to investigate the effectiveness and the efficiency of GA based on different variations of the chromosome representation, referred to as the job-based GA (jb-GA) and machine-based GA (mb-GA). We conducted numerical experiments using standard test problems (Benchmark test problems). We also present the comparison of results with those given by another heuristic algorithm (NBH Algorithm) and the optimal solutions reported in the literature. Those demonstrate the jb-GA is more effective and efficient almost all of the time. The current limitation of this approach, like many other heuristic methods, is that it still sometimes gives the near-optimal solutions. Keyword: genetic algorithm, scheduling, benchmark, flow shop

Item Type:	Other
Subjects:	Q Science > Q Science (General)
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User:	DR Admi Syarif
Date Deposited:	05 Jun 2020 09:50
Last Modified:	05 Jun 2020 09:50
URI:	http://repository.lppm.unila.ac.id/id/eprint/22011

Actions (login required)

View Item