TY  - JOUR
AU  - Ortuño, M. T.
AU  - Alonso-Ayuso, A.
AU  - Detti, Paolo
AU  - Escudero, Laureano F.
PY  - 2003
DO  - 10.1023/B:ANOR.0000004765.69773.41
SN  - 0254-5330
UR  - https://hdl.handle.net/20.500.14352/50247
T2  - Annals of Operations Research
AB  - 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...
LA  - eng
M2  - 111
PB  - Springer
KW  - Hamiltonian path
KW  - Sequential ordering problem
KW  - Precedences
KW  - Due dates
KW  - Minimum arborescence
KW  - Lagrangian relaxation
KW  - Permutation path
KW  - Traveling-salesman problem
KW  - Scheduling problems
KW  - Time windows
KW  - Algorithm
KW  - Constraints
KW  - Branch
KW  - Cut
TI  - On dual based lower bounds for the sequential ordering problem with precedences and due dates
TY  - journal article
VL  - 124
ER  -