Scheduling The Flow Shop With Blocking Problem With The Chaos-Induced Discrete Self Organising Migrating Algorithm

Davendra, Donald; Bialic-Davendra, Magdalena; Šenkeřík, Roman; Pluháček, Michal

doi:10.7148/2013-0386

Cited by 4 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that, a high performing Memetic Algorithm (MA) for the blocking problem minimizing makespan is appeared [27], where a constructive heuristic is presented (combining PF and NEH) and a memetic algorithm is proposed based on path-relinking based crossover and a referenced local search. At last, in [8], a chaos-induced discrete self organizing migrating algorithm is applied to the blocking problem and tested on the Taillard problem sets. Unlikely, there is a great work dedicated to developing both exact and heuristic algorithms for both makespan and total flow time criteria, it seems that little work has dealt with the total tardiness criterion until recently.…”

Section: Introductionmentioning

confidence: 99%

Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling

Nouri

Ladhari

2015

Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

The objective of this work is to present and evaluate metaheuristics for the blocking permutation flow shop scheduling problem subject to regular objectives. The blocking problem is known to be NP-hard with more than two machines. We assess the difficulty level of this problem by developing two population-based meta-heuristics: Genetic Algorithm and Artificial Bee Colony algorithm. The final goal is to measure the performance of these proposed techniques and potentially contribute in possible improvements in the blocking benchmark instances. Furthermore, computational tests carried out on randomly generated test problems show that the approaches consistently yields good solutions in a moderate amount of time. Finally, an updated list of best-known solutions for the Taillard's and Ronconi and Henriques's benchmark is exposed: new best-known solutions for the blocking flow shop scheduling problem with makespan, total flow time, and total tardiness criteria are found.

show abstract

Section: Introductionmentioning

confidence: 99%