Asset Details
Do you wish to reserve the book?
Research on the Flexible Job Shop Scheduling Problem with Job Priorities Considering Transportation Time and Setup Time
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.
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?
Research on the Flexible Job Shop Scheduling Problem with Job Priorities Considering Transportation Time and Setup Time
Do you wish to request the book?
Research on the Flexible Job Shop Scheduling Problem with Job Priorities Considering Transportation Time and Setup Time
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
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.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Research on the Flexible Job Shop Scheduling Problem with Job Priorities Considering Transportation Time and Setup Time
2025
Overview
This paper addresses the flexible job-shop scheduling problem with multiple time factors—namely, transportation time and setup time—as well as job priorities (referred to as FJSP-JPC-TST). An optimization model is established with the objective of minimizing the completion time. Considering the characteristics of the FJSP-JPC-TST, we propose an improved whale optimization algorithm that incorporates multiple strategies. First, a two-layer encoding mechanism based on operations and machines is introduced. To prevent illegal solutions, a priority-based encoding repair mechanism is designed, along with an active scheduling decoding method that fully considers multiple time factors and job priorities. Subsequently, a multi-level sub-population optimization strategy, an adaptive inertia weight, and a cross-population differential evolution strategy are implemented to enhance the optimization efficiency of the algorithm. Finally, extensive simulation experiments demonstrate that the proposed algorithm offers significant advantages and exhibits high reliability in effectively solving such scheduling problems.
