The following pages link to José Coelho (Q321001):
Displaying 14 items.
- An approach using SAT solvers for the RCPSP with logical constraints (Q321002) (← links)
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- Resource-constrained project scheduling with activity splitting and setup times (Q2003582) (← links)
- An evaluation of the adequacy of project network generators with systematically sampled networks (Q2463502) (← links)
- Going to the core of hard resource-constrained project scheduling instances (Q2664304) (← links)
- An analysis of network and resource indicators for resource-constrained project scheduling problem instances (Q2668709) (← links)
- A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem (Q6106485) (← links)
- New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms (Q6164372) (← links)
- Reducing the feasible solution space of resource-constrained project instances (Q6561212) (← links)
- A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a Boolean satisfiability solver (Q6565426) (← links)
- On the summary measures for the resource-constrained project scheduling problem (Q6581387) (← links)
- Correction to: ``On the summary measures for the resource-constrained project scheduling problem'' (Q6597012) (← links)
