Pages that link to "Item:Q1590040"
From MaRDI portal
The following pages link to Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040):
Displaying 8 items.
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- (Q2741380) (← links)
- An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
