A comparison of two exact algorithms for the sequential ordering problem

The sequential ordering problem is an NP-hard combinatorial optimization problem that arises in many real-world applications in logistics and scheduling. In this paper, we experimentally compare two exact algorithms that have been recently proposed for solving this problem. The comparison is done on a large set of benchmarks used in published work. In addition to comparing the performance of two different algorithms, this paper reports the closing of nine instances for the first time as well as seventeen improved upper and lower bounds.