On dual based lower bounds for the sequential ordering problem with precedences and due dates
From MaRDI portal
Publication:1417775
DOI10.1023/B:ANOR.0000004765.69773.41zbMath1053.90031MaRDI QIDQ1417775
Antonio Alonso-Ayuso, Paolo Detti, M. Teresa Ortuño, Laureano Fernando Escudero Bueno
Publication date: 6 January 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Lagrangian relaxation; due dates; Hamiltonian path; sequential ordering problem; precedences; minimum arborescence; permutation path
90B35: Deterministic scheduling theory in operations research
Related Items
Minimax regret spanning arborescences under uncertain costs, The multi-pickup and delivery problem with time windows, Exact algorithms for the multi-pickup and delivery problem with time windows