Employing Genetic Algorithm and Discrete Event Simulation for Flexible Job-Shop Scheduling Problem

被引：0

作者：

Azab, Eman ^{[1
]}

Said, Nour El-Din Ali ^{[2
]}

Nafea, Mohamed ^{[3
]}

Samaha, Yassin ^{[4
]}

Shihata, Lamia A. ^{[3
]}

Mashaly, Maggie ^{[4
]}

机构：

[1] German Univ Cairo, Fac IET, Dept Elect, Cairo, Egypt

[2] German Univ Cairo, Fac EMS, Dept Mechatron, Cairo, Egypt

[3] German Univ Cairo, Fac EMS, Design & Prod dept, Cairo, Egypt

[4] German Univ Cairo, Fac IET, Networks dept, Cairo, Egypt

来源：

2021 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI 2021) | 2021年

关键词：

Discrete Event Simulation; Dispatching Rules; Flexible Job-shop; Genetic Algorithm; Scheduling;

D O I：

10.1109/CSCI54926.2021.00165

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, a comparative study between Genetic Algorithm and Discrete Event Simulation to solve the flexible job-shop scheduling problem is presented. Two different approaches are used to generate a flexible job-shop schedule for a pharmaceutical factory X with minimum make-span which is defined as the duration required to complete all jobs. The first approach uses Genetic Algorithm to find an optimal or near-optimal solution for the flexible job-shop problem. The second approach uses Discrete Event Simulation and predefined dispatching rules to solve the flexible job-shop problem by creating a model for the pharmaceutical factory X production line. The same case study is used to evaluate the two approaches results. The Genetic Algorithm approach showed better performance compared to the Discrete Event Simulation approach for the same case study while using different dispatching rules. Both approaches showed better performance compared to basic sequential schedule.

引用

页码：620 / 624

页数：5

共 14 条

[1] Azab E., 2021, APPL SCI
[2] Cebi C., 2020, 2020 11 INT C COMP C, P1, DOI DOI 10.1109/ICCCNT49239.2020.9225581
[3] An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time
Defersha, Fantahun M.
Rooyani, Danial
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 147 (147)
[4] Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
Fanjul-Peyro, Luis
Ruiz, Ruben
Perea, Federico
[J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 173 - 182
[5] A real-time scheduling mechanism for a flexible manufacturing system: using simulation and dispatching rules
Jeong, KC
Kim, YD
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1998, 36 (09) : 2609 - 2626
[6] An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem
Martinez, Karim Perez
Adulyasak, Yossiri
Jans, Raf
Morabito, Reinaldo
Vitor Toso, Eli Angela
[J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 103 : 310 - 323
[7] Melanie M., 1996, INTRO GENETIC ALGORI
[8] Reactive scheduling approach for solving a realistic flexible job shop scheduling problem
Mihoubi, B.
Bouzouia, B.
Gaham, M.
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (19) : 5790 - 5808
[9] A genetic algorithm for the Flexible Job-shop Scheduling Problem
Pezzella, F.
Morganti, G.
Ciaschetti, G.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212
[10] Simulation-based performance assessment of master planning approaches in semiconductor manufacturing
Ponsignon, Thomas
Moench, Lars
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 46 : 21 - 35

← 1 2 →