New bounds and algorithms for the transshipment yard scheduling problem.
Nils BoysenFlorian JaehnErwin PeschPublished in: J. Sched. (2012)
Keyphrases
- scheduling problem
- upper and lower bounds
- learning algorithm
- computational complexity
- worst case
- lower bound
- theoretical analysis
- machine learning algorithms
- data structure
- significant improvement
- np hard
- computational cost
- error bounds
- randomized algorithm
- neural network
- asymptotically optimal
- orders of magnitude
- optimization problems
- simulated annealing
- upper bound
- decision trees