The Sequential Ordering Problem (herewith, SOP) with precedence relationships was introduced in Escudero (1988), and extended to cover release and due dates in Escudero and Sciomachen (1993). 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 of the problem. We also provide an heuristic separation procedure to obtain those cuts, so-called the Lagrangian Relax-and- Cut (LRC) scheme. Computational experience is given for variations of some SOP cases already reported in the literature.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||On dual based lower bounds for the sequential ordering problem with due dates|
|Rivista:||ANNALS OF OPERATIONS RESEARCH|
|Citazione:||Alonso, A.A., Detti, P., Escudero, L.F., & Ortuno, M.T. (2003). On dual based lower bounds for the sequential ordering problem with due dates. ANNALS OF OPERATIONS RESEARCH, 124(1-4), 111-131.|
|Appare nelle tipologie:||1.1 Articolo in rivista|