Minimizing makespan under data prefetching constraints for embedded vision systems : a study of optimization methods and their performance
Year of publication: |
2022
|
---|---|
Authors: | Salem, Khadija Hadj ; Jost, Vincent ; Kieffer, Yann ; Libralesso, Luc ; Mancini, Stéphane |
Subject: | Beam search | Constraint programming | Embedded vision systems | Greedy algorithms | Integer linear programming | LocalSolver | Makespan | Scheduling | Simulated annealing | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Modelling and solving approaches for scheduling problems in reconfigurable manufacturing systems
Delorme, Xavier, (2024)
-
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem
Shabtay, Dvir, (2024)
-
A production scheduling problem with uncertain sequence-dependent set-up times and random yield
Joo, Byung Jun, (2015)
- More ...
-
Iterative beam search algorithms for the permutation flowshop
Libralesso, Luc, (2022)
-
The facets of the polytope of modules of a graph
Kieffer, Yann, (2003)
-
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Libralesso, Luc, (2021)
- More ...