Iterative beam search algorithms for the permutation flowshop
Year of publication: |
2022
|
---|---|
Authors: | Libralesso, Luc ; Focke, Pablo Andres ; Secardin, Aurélien ; Jost, Vincent |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 301.2022, 1 (16.8.), p. 217-234
|
Subject: | Flowtime | Heuristics | Iterative beam search | Makespan | Permutation flowshop | Heuristik | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory |
-
The optimal number of used machines in a two-stage flexible flowshop scheduling problem
Gerstl, Enrique, (2014)
-
Relaxation and self-supervised machine learning for the hybrid flow shop assignment problem
Tonnius, Annika, (2023)
-
Abedinnia, Hamid, (2016)
- More ...
-
Salem, Khadija Hadj, (2022)
-
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Libralesso, Luc, (2021)
-
Simultaneous optimization of classical objectives in JIT scheduling
Lebacque, Vassilissa, (2007)
- More ...