An Adaptive Search Algorithm for Multiplicity Dynamic Flexible Job Shop Scheduling with New Order Arrivals

In today’s customer-centric economy, the demand for personalized products has compelled corporations to develop manufacturing processes that are more flexible, efficient, and cost-effective. Flexible job shops offer organizations the agility and cost-efficiency that traditional manufacturing process...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Symmetry (Basel) Ročník 16; číslo 6; s. 641
Hlavní autori: Ding, Linshan, Guan, Zailin, Luo, Dan, Rauf, Mudassar, Fang, Weikang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.06.2024
Predmet:
Acceleration
Adaptive algorithms
Adaptive search techniques
Algorithms
Arrivals
Backup software
Decision making
Efficiency
Fluid dynamics
Heuristic
Job shop scheduling
Job shops
Manufacturing
Methods
Optimization techniques
Researchers
Scheduling
Search algorithms
Solution space
Tabu search
ISSN:2073-8994, 2073-8994
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In today’s customer-centric economy, the demand for personalized products has compelled corporations to develop manufacturing processes that are more flexible, efficient, and cost-effective. Flexible job shops offer organizations the agility and cost-efficiency that traditional manufacturing processes lack. However, the dynamics of modern manufacturing, including machine breakdown and new order arrivals, introduce unpredictability and complexity. This study investigates the multiplicity dynamic flexible job shop scheduling problem (MDFJSP) with new order arrivals. To address this problem, we incorporate the fluid model to propose a fluid randomized adaptive search (FRAS) algorithm, comprising a construction phase and a local search phase. Firstly, in the construction phase, a fluid construction heuristic with an online fluid dynamic tracking policy generates high-quality initial solutions. Secondly, in the local search phase, we employ an improved tabu search procedure to enhance search efficiency in the solution space, incorporating symmetry considerations. The results of the numerical experiments demonstrate the superior effectiveness of the FRAS algorithm in solving the MDFJSP when compared to other algorithms. Specifically, the proposed algorithm demonstrates a superior quality of solution relative to existing algorithms, with an average improvement of 29.90%; and exhibits an acceleration in solution speed, with an average increase of 1.95%.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-8994
2073-8994
DOI:10.3390/sym16060641