A new leader guided optimization for the flexible job shop problem

Fraj Naifar (), Mariem Gzara () and Moalla Taicir Loukil ()
Additional contact information
Fraj Naifar: Digital Research Center of Sfax
Mariem Gzara: Multimedia InfoRmation Systems and Advanced Computing Laboratory MIRACL
Moalla Taicir Loukil: Tabuk University

Journal of Combinatorial Optimization, 2020, vol. 39, issue 2, No 17, 602-617

Abstract: Abstract The FJSP is an extension of the classical job shop problem which has been proven to be among the hardest combinatorial optimization problems, by allowing an operation to be operated on more than one machine from a machine set, with possibility of variable performances. In this work, we have designed a co-evolutionary algorithm that applies adaptively multiple crossover and mutation operators. In the evolution process, all new generated individuals are improved by local search. Combined with a new leader tree guided optimization search, the hybrid algorithm has discovered 2 new optimal solutions for instances of Hurink et al. (Oper Res Spektrum 15(4):205–215, 1994). In general, the outcomes of simulation results and comparisons demonstrate comparable results. The leader guided optimization has shown its effectiveness for minimizing the makespan in a FJSP, but it is not limited to this environment.

Keywords: Scheduling; Flexible job shop problem; Evolutionary algorithm; Leader guided optimization; Multiple crossovers (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-00373-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-018-00373-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-00373-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().