Online algorithms with advice for bin packing and scheduling problems.
Marc P. RenaultAdi RosénRob van SteePublished in: Theor. Comput. Sci. (2015)
Keyphrases
- bin packing
- online algorithms
- scheduling problem
- online learning
- lower bound
- learning algorithm
- np hard
- graph colouring
- worst case
- single machine
- flowshop
- average case
- processing times
- competitive ratio
- search tree
- asymptotically optimal
- packing problem
- tabu search
- linear space
- upper bound
- precedence constraints
- decision boundary
- uniform distribution
- training set
- integer programming
- genetic algorithm