Currently browsing author

Mathijs de Weerdt

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 …