A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time-Reference-Cited by-同舟云学术

A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time

Published:2021-12-07 Issue: Volume: Page:
ISSN:
Container-title:2021 14th International Conference on Developments in eSystems Engineering (DeSE)
language:
Short-container-title:

Author:

Fekih Asma¹,Hadda Hatem¹,Kacem Imed²,Hadj-Alouane Atidel B.³

Affiliation:

1. LR-OASIS, National Engineering, School of Tunis, University of Tunis El Manar,Tunis,Tunisia,1002

2. Université de Lorraine,Laboratoire LCOMS EA 7306,Metz,France

3. LR-OASIS, National Engineering School of Tunis, University of Tunis El Manar, Engineering and Engineering Management, University of Sharjah,Departmer College of Engineering,Sharjah,United Arab Emirates

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9718563/9719327/09719336.pdf?arnumber=9719336

Reference28 articles.

1. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems

2. An effective architecture for learning and evolving flexible job-shop schedules

3. A genetic algorithm for the Flexible Job-shop Scheduling Problem

4. An effective multi-swarm collaborative evolutionary algorithm for flexible job shop scheduling problem

5. Solving flexible job shop scheduling using an effective memetic algorithm

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A new solution encoding scheme for solving the Flexible Job-Shop Scheduling Problem;2023 IEEE Congress on Evolutionary Computation (CEC);2023-07-01

2. A Scheduling Method for Heterogeneous Signal Processing Platforms Based on Quantum Genetic Algorithm;Applied Sciences;2023-03-30