Almost sure asymptotic optimality for online routing and machine scheduling problems.
Patrick JailletMichael R. WagnerPublished in: Networks (2010)
Keyphrases
- flowshop
- asymptotic optimality
- scheduling problem
- processing times
- single machine
- special case
- tabu search
- setup times
- sequence dependent setup times
- online learning
- shortest processing time
- asymptotically optimal
- parallel machines
- np hard
- precedence constraints
- job shop
- strongly np hard
- routing protocol
- parallel machine scheduling problem
- real time
- job shop scheduling problem
- ad hoc networks
- greedy heuristics