Research on Multi-Objective Flexible Job Shop Scheduling Problem with Setup and Handling Based on an Improved Shuffled Frog Leaping Algorithm
Open Access
- 9 May 2024
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 14 (10) , 4029
Abstract
Flexible job shop scheduling problem (FJSP), widely prevalent in many intelligent manufacturing industries, is one of the most classic problems of production scheduling and combinatorial optimization. In actual manufacturing enterprises, the setup of machines and the handling of jobs have an important impact on the scheduling plan. Furthermore, there is a trend for a cluster of machines with similar functionalities to form a work center. Considering the above constraints, a new order-driven multi-equipment work center FJSP model with setup and handling including multiple objectives encompassing the minimization of the makespan, the number of machine shutdowns, and the number of handling batches is established. An improved shuffled frog leading algorithm is designed to solve it through the optimization of the initial solution population, the improvement of evolutionary operations, and the incorporation of Pareto sorting. The algorithm also combines the speed calculation method in the gravity search algorithm to enhance the stability of the solution search. Some standard FJSP data benchmarks have been selected to evaluate the effectiveness of the algorithm, and the experimental results confirm the satisfactory performance of the proposed algorithm. Finally, a problem example is designed to demonstrate the algorithm’s capability to generate an excellent scheduling plan.Keywords
Funding Information
- the Humanities and Social Science Youth foundation of the Ministry of Education of China (20YJC630054)
This publication has 27 references indexed in Scilit:
- A multi-agent system for FJSP with setup and transportation timesExpert Systems with Applications, 2022
- A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problemComputers & Operations Research, 2021
- A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problemComputers & Industrial Engineering, 2020
- A new algorithm based on gray wolf optimizer and shuffled frog leaping algorithm to solve the multi-objective optimization problemsApplied Soft Computing, 2020
- Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problemComputers & Operations Research, 2020
- Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibilityJournal of Manufacturing Systems, 2020
- An effective multi-start multi-level evolutionary local search for the flexible job-shop problemEngineering Applications of Artificial Intelligence, 2017
- A survey of scheduling problems with setup times or costsEuropean Journal of Operational Research, 2008
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993