Login / Signup
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths.
Jean-Charles Billaut
Federico Della Croce
Fabio Salassa
Vincent T'kindt
Published in:
CoRR (2017)
Keyphrases
</>
scheduling problem
scheduling algorithm
response time
dynamic scheduling
round robin
resource allocation
parallel machines
databases
preventive maintenance
shortest path
resource constraints
scheduling strategy
container terminal
graph coloring
optimal path
level set method
web services
decision making