A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem

A new radial memetic algorithm is proposed to resolve the no-wait job-shop scheduling problem. Basically, each sequencing solution is factorized as a distance-based ranking model, i.e., each solution is decomposed in <i>n</i> − 1 terms, where <i>n</i> is the number of jobs to...

Full description

Saved in:
Bibliographic Details
Main Author: Ricardo Pérez-Rodríguez
Format: Article
Language:English
Published: MDPI AG 2024-10-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/12/21/3342
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1846173312133103616
author Ricardo Pérez-Rodríguez
author_facet Ricardo Pérez-Rodríguez
author_sort Ricardo Pérez-Rodríguez
collection DOAJ
description A new radial memetic algorithm is proposed to resolve the no-wait job-shop scheduling problem. Basically, each sequencing solution is factorized as a distance-based ranking model, i.e., each solution is decomposed in <i>n</i> − 1 terms, where <i>n</i> is the number of jobs to be sequenced. After that, a cumulative radial distribution of hydrogen is considered to produce new factorizations using the offspring information (genes). Such radial distribution is applied in the local optimization procedure of the memetic algorithm. A benchmarking dataset is used to show the performance of this new experimental technique, as well as other current procedures. Statistical tests were implemented to confirm the performance of the proposed scheme.
format Article
id doaj-art-5ba3d17999a4445783a93d25a06f95dd
institution Kabale University
issn 2227-7390
language English
publishDate 2024-10-01
publisher MDPI AG
record_format Article
series Mathematics
spelling doaj-art-5ba3d17999a4445783a93d25a06f95dd2024-11-08T14:37:36ZengMDPI AGMathematics2227-73902024-10-011221334210.3390/math12213342A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling ProblemRicardo Pérez-Rodríguez0Research Group, CONAHCYT, Av Insurgentes Sur 1582, Crédito Constructor, Benito Juárez, Mexico City 03940, MexicoA new radial memetic algorithm is proposed to resolve the no-wait job-shop scheduling problem. Basically, each sequencing solution is factorized as a distance-based ranking model, i.e., each solution is decomposed in <i>n</i> − 1 terms, where <i>n</i> is the number of jobs to be sequenced. After that, a cumulative radial distribution of hydrogen is considered to produce new factorizations using the offspring information (genes). Such radial distribution is applied in the local optimization procedure of the memetic algorithm. A benchmarking dataset is used to show the performance of this new experimental technique, as well as other current procedures. Statistical tests were implemented to confirm the performance of the proposed scheme.https://www.mdpi.com/2227-7390/12/21/3342radial distributionevolutionary algorithmsno-wait job-shopscheduling
spellingShingle Ricardo Pérez-Rodríguez
A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
Mathematics
radial distribution
evolutionary algorithms
no-wait job-shop
scheduling
title A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
title_full A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
title_fullStr A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
title_full_unstemmed A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
title_short A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
title_sort radial memetic algorithm to resolve the no wait job shop scheduling problem
topic radial distribution
evolutionary algorithms
no-wait job-shop
scheduling
url https://www.mdpi.com/2227-7390/12/21/3342
work_keys_str_mv AT ricardoperezrodriguez aradialmemeticalgorithmtoresolvethenowaitjobshopschedulingproblem
AT ricardoperezrodriguez radialmemeticalgorithmtoresolvethenowaitjobshopschedulingproblem