What have satellite scheduling, the selected traveling salesperson (orienteering) problem, and make-to-order manufacturing in common?

First, these problems can all be modeled as a single-machine scheduling problem with release times, deadlines, time/sequence dependent setup times, and rejection, which is strongly NP-hard. Second, most instances are solved either best or fastest with one of our new algorithms! Some instances have been solved by us to optimality …

The impact of algorithms

I was interviewed by Martijn Engelsman for a blog post on the website of our faculty on algorithms. I explained my vision …