Login / Signup
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.
Jean-Charles Billaut
Federico Della Croce
Fabio Salassa
Vincent T'kindt
Published in:
J. Sched. (2019)
Keyphrases
</>
artificial intelligence
machine learning
scheduling problem
shortest path
search engine
social networks
image sequences
special case
single machine
scheduling algorithm
path length
round robin
flexible manufacturing systems
dynamic scheduling
path selection
multiple paths