In this paper, we present the computational test results of an implementation made of an exact algorithm proposed in the literature to solve a sequencing problem that arises in some productive environments where open orders of clients should be minimized. From the computational tests, it can be observed that the dominance criteria incorporated in the enumeration process of this algorithm reduces the search space, making the algorithm more efficient in terms of execution time.
Job sequencing; Enumeration
