On dual based lower bounds for the sequential ordering problem with precedences and due dates
From MaRDI portal
(Redirected from Publication:1417775)
Recommendations
- On due-date based valid cuts for the sequential ordering problem
- Handling precedence constraints in scheduling problems by the sequence pair representation
- A dual criteria sequencing problem with earliness and tardiness penalties
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- scientific article; zbMATH DE number 2159167
- scientific article; zbMATH DE number 5605136
- On the sequential ordering problems
- scientific article; zbMATH DE number 1538846
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
Cited in
(6)- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- Local search procedures for improving feasible solutions to the sequential ordering problem
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- 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
This page was built for publication: On dual based lower bounds for the sequential ordering problem with precedences and due dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1417775)
