A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem

This paper addresses the Flexible Job Shop Scheduling Problem (FJSSP) where the objective is to minimize the makespan. We develop a parallel hybrid Differential Evolution (DE) algorithm to tackle this problem. A random key representation of the FJSSP is adopted, which requires a very simple conversi...

Descripción completa

Detalles Bibliográficos
Autores principales: Morero, Franco, Bermúdez, Carlos, Salto, Carolina
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2019
Materias:
Ciencias Informáticas
Flexible job shop scheduling
Differential evolution algorithm
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/90890
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-90890
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Flexible job shop scheduling
Differential evolution algorithm
spellingShingle Ciencias Informáticas
Flexible job shop scheduling
Differential evolution algorithm
Morero, Franco
Bermúdez, Carlos
Salto, Carolina
A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
topic_facet Ciencias Informáticas
Flexible job shop scheduling
Differential evolution algorithm
description This paper addresses the Flexible Job Shop Scheduling Problem (FJSSP) where the objective is to minimize the makespan. We develop a parallel hybrid Differential Evolution (DE) algorithm to tackle this problem. A random key representation of the FJSSP is adopted, which requires a very simple conversion mechanism to obtain a feasible schedule. This allows the DE algorithm to work on the continuous domain to explore the problem space of the discrete FJSSP. Moreover, a simple local search algorithm is embedded in the DE framework to balance the exploration and exploitation by enhancing the local searching ability. In addition, parallelism of the DE operations is included to improve the efficiency of whole algorithm. Experiments confirm the significant improvement achieved by integrating the propositions introduced in this study. Additional, test results show that our algorithm is competitive when compared with most existing approaches for the FJSSP.
format Objeto de conferencia
Objeto de conferencia
author Morero, Franco
Bermúdez, Carlos
Salto, Carolina
author_facet Morero, Franco
Bermúdez, Carlos
Salto, Carolina
author_sort Morero, Franco
title A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
title_short A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
title_full A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
title_fullStr A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
title_full_unstemmed A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
title_sort simple differential evolution algorithm to solve the flexible job shop scheduling problem
publishDate 2019
url http://sedici.unlp.edu.ar/handle/10915/90890
work_keys_str_mv AT morerofranco asimpledifferentialevolutionalgorithmtosolvetheflexiblejobshopschedulingproblem
AT bermudezcarlos asimpledifferentialevolutionalgorithmtosolvetheflexiblejobshopschedulingproblem
AT saltocarolina asimpledifferentialevolutionalgorithmtosolvetheflexiblejobshopschedulingproblem
AT morerofranco simpledifferentialevolutionalgorithmtosolvetheflexiblejobshopschedulingproblem
AT bermudezcarlos simpledifferentialevolutionalgorithmtosolvetheflexiblejobshopschedulingproblem
AT saltocarolina simpledifferentialevolutionalgorithmtosolvetheflexiblejobshopschedulingproblem
bdutipo_str Repositorios
_version_ 1764820490495459328

Ejemplares similares