Open AccessAn Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem
Author(s) -
Lucien Mousin,
MarieÉléonore Kessaci,
Clarisse Dhaenens
Publication year - 2017
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - greedy algorithm , computer science , mathematical optimization , iterated function , job shop scheduling , scheduling (production processes) , exploit , iterated local search , permutation (music) , constraint (computer aided design) , algorithm , local search (optimization) , mathematics , routing (electronic design automation) , mathematical analysis , computer network , physics , computer security , geometry , acoustics