A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion

Bargaoui, Hafewa; Driss, Olfa Belkahla; Ghédira, Khaled

doi:10.1016/j.cie.2017.07.020

Cited by 116 publications

(25 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…9,10 The sequence of jobs assigned to factory f was given, where each job on each machine has a processing time. 11 The general objective is to minimize the total processing time. 12,13 The method to solve related DPFSP has attracted much attention.…”

Section: Introductionmentioning

confidence: 99%

Solving robotic distributed flowshop problem using an improved iterated greedy algorithm

Gao

et al. 2019

International Journal of Advanced Robotic Systems

View full text Add to dashboard Cite

In this study, we propose an improved iterated greedy algorithm for solving the distributed permutation flowshop problem, where there is a single robot in each factory and the makespan needs to be minimized. In the problem considered, the robot is used to transfer each job from the predecessor machine to the successor machine. A blocking constraint between machines is considered, thus jobs should remain on the completed machine while waiting for the robot. The loading and unloading times are considered and different for all of the jobs conducted by the robot, and the deteriorating time is also considered. In the proposed algorithm, first, four types of neighborhood structures are developed. Then, the simulated annealing algorithm is embedded in the proposed algorithm to enhance the exploration abilities. Furthermore, a problem-specific destruction and construction strategies are investigated. Finally, several realistic instances were generated to test the proposed algorithm, and its competitive performance was verified based on detailed experimental comparisons.

show abstract

Section: Introductionmentioning

confidence: 99%

Solving robotic distributed flowshop problem using an improved iterated greedy algorithm

Gao

et al. 2019

International Journal of Advanced Robotic Systems

View full text Add to dashboard Cite

show abstract

“…Bu seçim, aşağıdaki Denklem 8 ile hesaplanan olasılık değerine bağlı olarak yapılır. (8) Buradaki , . besin kaynağının uygunluk değerini ifade etmektedir.…”

Section: Gözlemci Arı Aşamasıunclassified

“…ve ark [8]. DPATÇP maksimum tamamlanma süresini en aza indirgemeyi amaçlayan bir meta sezgisel olan kimyasal reaksiyon optimizasyon algoritmasını önermişlerdir.…”

unclassified

Dağıtık Permütasyon Akış Tipi Çizelgeleme Problemlerinin Yapay Arı Koloni Algoritması İle Çözümü

Küpeli¹,

Sarucan²,

Küpeli³

2020

El-Cezeri Fen Ve Mühendislik Dergisi

View full text Add to dashboard Cite

Bu çalışmada amaç fonksiyonu maksimum tamamlanma süresinin minimizasyonu olan dağıtık permütasyon akış tipi çizelgeleme problemleri ele alınmıştır. Bu problemin klasik akış tipi çizelgeleme probleminden farkı, işlerin birden fazla fabrikaya dağıtılmasıdır. Problemin çözümünde doğadaki arıların besin arama davranışını temel alan yapay arı koloni algoritması kullanılmıştır. Algoritmanın başlangıç çözümleri üretmesinde NEH (Nawaz Enscore Ham) sezgiselinden yararlanılmıştır. Algoritmanın evrelerinde (işçi, gözlemci ve kâşif arı evresi) komşu çözümler için yer değiştirme metodu kullanılmıştır. Bu metotta rastgele seçilen iki işin yerleri değiştirilerek farklı iş sıraları elde edilmiştir. Algoritmanın problem üzerindeki başarısı literatürde iyi bilinin Taillard'ın küçük ve büyük boyutlu test problemleri kullanılarak ölçülmüştür. Algoritma, 14 adet sezgisel ile karşılaştırılmıştır ve en iyi sonuçları sunmuştur.

show abstract

“…Moreover, two iterative methods based on variable neighborhood descent (VND) [23] are proposed to search for better neighborhoods of the solution. Following this pioneering work, several approaches were surveyed and applied for DFSP, such as electromagnetism-like mechanism algorithm [24], hybrid genetic algorithm [25], Tabu search algorithm [26], estimation of distribution algorithm [27], scatter search algorithm [28], immune algorithm [29], chemical reaction optimization algorithm [30], and iterated greedy algorithm [31,32]. It is worth noting that Fernandez et al [33] investigated DFSP with the total flow time (TFT) criterion for the first time in 2015.…”

Section: Distributed Flowshop Scheduling Problem (Dfsp)mentioning

confidence: 99%

Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm

et al. 2019

View full text Add to dashboard Cite

This study attempts to optimize the scheduling decision to save production cost (e.g., energy consumption) in a distributed manufacturing environment that comprises multiple distributed factories and where each factory has one flow shop with blocking constraints. A new scheduling optimization model is developed based on a discrete fruit fly optimization algorithm (DFOA). In this new evolutionary optimization method, three heuristic methods were proposed to initialize the DFOA model with good quality and diversity. In the smell-based search phase of DFOA, four neighborhood structures according to factory reassignment and job sequencing adjustment were designed to help explore a larger solution space. Furthermore, two local search methods were incorporated into the framework of variable neighborhood descent (VND) to enhance exploitation. In the vision-based search phase, an effective update criterion was developed. Hence, the proposed DFOA has a large probability to find an optimal solution to the scheduling optimization problem. Experimental validation was performed to evaluate the effectiveness of the proposed initialization schemes, neighborhood strategy, and local search methods. Additionally, the proposed DFOA was compared with well-known heuristics and metaheuristics on small-scale and large-scale test instances. The analysis results demonstrate that the search and optimization ability of the proposed DFOA is superior to well-known algorithms on precision and convergence.

show abstract

A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion

Cited by 116 publications

References 26 publications

Solving robotic distributed flowshop problem using an improved iterated greedy algorithm

Solving robotic distributed flowshop problem using an improved iterated greedy algorithm

Dağıtık Permütasyon Akış Tipi Çizelgeleme Problemlerinin Yapay Arı Koloni Algoritması İle Çözümü

Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm

Contact Info

Product

Resources

About