Pages that link to "Item:Q2815442"
From MaRDI portal
The following pages link to An optimal constraint programming approach to the open-shop problem (Q2815442):
Displaying 14 items.
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem (Q679422) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (Q2226489) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Hybrid metaheuristics for stochastic constraint programming (Q2342607) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
