MbrlCatalogueTitleDetail

Do you wish to reserve the book?
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots
Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots
Journal Article

Dual-self-learning co-evolutionary algorithm for energy-efficient flexible job shop scheduling problem with processing- transportation composite robots

2025
Request Book From Autostore and Choose the Collection Method
Overview
The processing-transportation composite robots, with their dual functions of processing and transportation, as well as comprehensive robot-machine interactions, have been widely and efficiently applied in the manufacturing industry, leading to a continuous increase in energy consumption. Hence, this work focuses on investigating robot-machine integrated energy-efficient scheduling in flexible job shop environments. To address the new problem, an innovative mixed-integer linear programming model and a novel dual-self-learning co-evolutionary algorithm are proposed, aimed at minimizing the total energy consumption and makespan. In the proposed algorithm, a three-dimensional vector is first used to comprehensively express the solution, and then a greedy decoding strategy is designed to reduce the idle time and energy consumption simultaneously. A hybrid initialization method with adaptive random selection and chaos mapping is developed to ensure the diversity and high quality of the initial solutions. A dual-self-learning mechanism, including a self-learning evolutionary mechanism and a self-learning cooperation mechanism, is designed to select suitable evolutionary operators and enhance interactions between populations, respectively. Finally, multiple sets of experiments are conducted to demonstrate the effectiveness of the proposed mathematical model, improved components and algorithm through numerical, statistical, and differential analyses.