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

Ricardo Pérez-Rodríguez ()
Additional contact information
Ricardo Pérez-Rodríguez: Research Group, CONAHCYT, Av Insurgentes Sur 1582, Crédito Constructor, Benito Juárez, Mexico City 03940, Mexico

Mathematics, 2024, vol. 12, issue 21, 1-15

Abstract: 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 n − 1 terms, where n 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.

Keywords: radial distribution; evolutionary algorithms; no-wait job-shop; scheduling (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/21/3342/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/21/3342/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:21:p:3342-:d:1506120

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().