Currently browsing category

Research

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 …

ICAPS Workshops

The list of workshops for the ICAPS conference in Delft (June 25-26 2018) has been published. All have deadlines early March 2018 and notifications in April. Please click the links below for details. Acronym Workshop Organizers COPLAS Constraint Satisfaction Techniques for Planning and Scheduling Roman Bartak Miguel Salido HSDIP Heuristics …