A Hybrid ILS-VND Based Hyper-heuristic for Permutation Flowshop Scheduling Problem | Zendy

Hiba Yahyaoui | Zendy; Saoussen Krichen | Zendy; Bilel Derbel | Zendy; ElGhazali Talbi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Hybrid ILS-VND Based Hyper-heuristic for Permutation Flowshop Scheduling Problem

Author(s) -

Hiba Yahyaoui,

Saoussen Krichen,

Bilel Derbel,

ElGhazali Talbi

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.08.199

Subject(s) - computer science , job shop scheduling , heuristics , permutation (music) , mathematical optimization , iterated local search , heuristic , scheduling (production processes) , flow shop scheduling , local search (optimization) , algorithm , mathematics , artificial intelligence , schedule , physics , acoustics , operating system

International audienceIn 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research