The following pages link to Mario Vanhoucke (Q213373):
Displayed 50 items.
- (Q282235) (redirect page) (← links)
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
- (Q321000) (redirect page) (← links)
- 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)
- (Q415555) (redirect page) (← links)
- Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem (Q415556) (← links)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
- (Q588785) (redirect page) (← links)
- An evolutionary approach for the nurse rerostering problem (Q632687) (← links)
- Maximising the weighted number of activity execution modes in project planning (Q724006) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- Comparison and hybridization of crossover operators for the nurse scheduling problem (Q940898) (← links)
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem (Q969750) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- On the characterization and generation of nurse scheduling problem instances (Q1027526) (← links)
- Measuring time. Improving project performance using earned value management (Q1034329) (← links)
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (Q1037664) (← links)
- (Q1628052) (redirect page) (← links)
- A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs (Q1631504) (← links)
- Computing project makespan distributions: Markovian PERT networks revisited (Q1634063) (← links)
- The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models (Q1634073) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- An agency perspective for multi-mode project scheduling with time/cost trade-offs (Q1722976) (← links)
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
- A nearest neighbour extension to project duration forecasting with artificial intelligence (Q1751933) (← links)
- Capital- and resource-constrained project scheduling with net present value optimization (Q1752257) (← links)
- A buffer control method for top-down project control (Q1754043) (← links)
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
- New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
- Progress payments in project scheduling problems. (Q1812008) (← links)
- Resource-constrained project scheduling with activity splitting and setup times (Q2003582) (← links)
- A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing (Q2027048) (← links)
- Using schedule risk analysis with resource constraints for project control (Q2028756) (← links)
- A new algorithm for resource-constrained project scheduling with breadth and depth of skills (Q2030541) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- Multimode time-cost-robustness trade-off project scheduling problem under uncertainty (Q2156293) (← links)
- The impact of a limited budget on the corrective action taking process (Q2189899) (← links)
- The bilevel optimisation of a multi-agent project scheduling and staffing problem (Q2239938) (← links)
- Using earned value management and schedule risk analysis with resource constraints for project control (Q2242244) (← links)
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances (Q2256244) (← links)
- A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← links)
- A metaheuristic solution approach for the time-constrained project scheduling problem (Q2362168) (← links)
- A resource type analysis of the integrated project scheduling and personnel staffing problem (Q2398432) (← links)
- An evaluation of the adequacy of project network generators with systematically sampled networks (Q2463502) (← links)
- Rangen: A random network generator for activity-on-the-node networks (Q2464376) (← links)
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling (Q2570161) (← links)
- Optimizing production capacity and safety stocks in general acyclic supply chains (Q2664281) (← links)
- Going to the core of hard resource-constrained project scheduling instances (Q2664304) (← links)