On dual based lower bounds for the sequential ordering problem with precedences and due dates

The Sequential Ordering Problem (herewith, SOP) with precedence relationships was introduced by Escudero, and extended to cover release and due dates by Escudero and Sciomachen. It has a broad range of applications, mainly in production planning for manufacturing systems. The problem consists of finding a minimum weight Hamiltonian path on a directed graph with weights on the nodes and the arcs, satisfying precedence relationships among the nodes and given lower and upper bounds on the weights of the Hamiltonian subpaths. In this paper we present a model for the constrained minimum weight Hamiltonian path problem with precedences and due dates forcing constraints, and introduce related valid cuts that can be used in a separation framework for the dual (Lagrangian based) relaxation to the problem. We also provide an heuristic separation procedure to obtain those cuts, the so-called Lagrangian Relax-and-Cut scheme. Computational experience is given for variations of some SOP cases already reported in the literature.