Pages that link to "Item:Q1297694"
From MaRDI portal
The following pages link to A new tabu search procedure for an audit-scheduling problem (Q1297694):
Displaying 5 items.
- Temporal linear relaxation in IBM ILOG CP optimizer (Q309055) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- Activity list representation for a generalization of the resource-constrained project scheduling problem (Q1042097) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
