Skip to Main content Skip to Navigation
Conference papers

A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem

Abstract : In this paper an iterated local search (ILS) is embedded with a variable neighborhood Descent (VND) hyper-heuristic. The proposed hyper-heuristic combines low-level heuristics. Several variants from the literature within the proposed ILS were implemented and tested. This article conducts an empirical study involving hard combinatorial optimization problems, permutation flowshop scheduling problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. The proposed ILS based hyper-heuristic proved its general and applicable across the studied problems.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01249486
Contributor : Talbi El-Ghazali <>
Submitted on : Friday, January 1, 2016 - 7:49:09 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM

Links full text

Identifiers

Citation

Hiba Yahyaoui, Saoussen Krichen, Bilel Derbel, El-Ghazali Talbi. A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem. KES‘2015 19th Int. Conf. on Knowledge-based and Intelligent Information & Engineering Systems, 2015, Singapour, Singapore. pp.632-641, ⟨10.1016/j.procs.2015.08.199⟩. ⟨hal-01249486⟩

Share

Metrics

Record views

292