Scheduling algorithms for ATM applications — Tools and toys

⇁ “Tools or Toy?” is the wrong question "7 “Expert or Novice?” is the question ⇁ Take/Select is a very good heuristic. ⇁ Tailoring to runtime or quality efficiency is very easy by the window size. ⇁ Take/Select with iteration is efficient, if no suitable pre-sorting is possible. ⇁ Do not use Branch&Bound-Algorithm. Use A^∗. At least with monotonic objective function the look-ahead function h is for free. ⇁ Global heuristics (e.g. Greedy or Tabu-Search) have good runtime characteristics, even for large number of elements. They, however, sometimes stop in local optima. ⇁ With increasing window size (and increasing run-time) Take/Select\´s quality results improve.