Pages that link to "Item:Q2029253"
From MaRDI portal
The following pages link to A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253):
Displaying 9 items.
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- An approach using SAT solvers for the RCPSP with logical constraints (Q321002) (← links)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (Q1303751) (← links)
- An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) (← links)
- An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem (Q5948200) (← links)