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...
Saved in:
| Main Author: | |
|---|---|
| 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!
|