An effective hybrid teaching–learning-based optimization algorithm for permutation flow shop scheduling problem

•A teaching–learning-based optimization is proposed for flow shop problem.•A variable neighborhood search is proposed for fast solution improvement.•A simulated annealing is adopted as the local search method of VNS.•For the DMU problems, some new upper bounds have been obtained. Permutation flow sh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Advances in engineering software (1992) Jg. 77; S. 35 - 47
Hauptverfasser: Xie, Zhanpeng, Zhang, Chaoyong, Shao, Xinyu, Lin, Wenwen, Zhu, Haiping
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.11.2014
Schlagworte:
Algorithms
Criteria
Lateness
Makespan
Maximum lateness
Minimization
Optimization
Permutation flow shop scheduling problem
Permutations
Scheduling
Simulated annealing
Teaching-learning-based optimization algorithm
Upper bounds
Variable neighborhood search
Permutation flow shop scheduling problem
Teaching-learning-based optimization algorithm
Makespan
Variable neighborhood search
Maximum lateness
Simulated annealing
ISSN:0965-9978
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•A teaching–learning-based optimization is proposed for flow shop problem.•A variable neighborhood search is proposed for fast solution improvement.•A simulated annealing is adopted as the local search method of VNS.•For the DMU problems, some new upper bounds have been obtained. Permutation flow shop scheduling (PFSP) is among the most studied scheduling settings. In this paper, a hybrid Teaching–Learning-Based Optimization algorithm (HTLBO), which combines a novel teaching–learning-based optimization algorithm for solution evolution and a variable neighborhood search (VNS) for fast solution improvement, is proposed for PFSP to determine the job sequence with minimization of makespan criterion and minimization of maximum lateness criterion, respectively. To convert the individual to the job permutation, a largest order value (LOV) rule is utilized. Furthermore, a simulated annealing (SA) is adopted as the local search method of VNS after the shaking procedure. Experimental comparisons over public PFSP test instances with other competitive algorithms show the effectiveness of the proposed algorithm. For the DMU problems, 19 new upper bounds are obtained for the instances with makespan criterion and 88 new upper bounds are obtained for the instances with maximum lateness criterion.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0965-9978
DOI:10.1016/j.advengsoft.2014.07.006