Pages that link to "Item:Q3360656"
From MaRDI portal
The following pages link to Une méthode arborescente pour résoudre les problèmes cumulatifs (Q3360656):
Displaying 22 items.
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions (Q280177) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints (Q890001) (← links)
- Methods to solve multi-skill project scheduling problem (Q926572) (← links)
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation (Q1266547) (← links)
- A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case (Q1681264) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914) (← links)
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems (Q1960325) (← links)
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- IP-based energetic reasoning for the resource constrained project scheduling problem (Q2883582) (← links)
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem (Q3598682) (← links)
