Pages that link to "Item:Q2892296"

The following pages link to A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem (Q2892296):

Displaying 34 items.

• On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
• Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (Q337299) (← 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)
• Project scheduling with flexible resources: formulation and inequalities (Q443821) (← links)
• Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure (Q471724) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Event-based MILP models for resource-constrained project scheduling problems (Q709100) (← links)
• Reactive scheduling in the multi-mode RCPSP (Q709110) (← links)
• Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty (Q747027) (← links)
• A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
• A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (Q1037664) (← links)
• A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem (Q1651597) (← links)
• Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement (Q1718808) (← links)
• A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags (Q1736833) (← links)
• A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling (Q1744895) (← links)
• A local branching heuristic for the open pit mine production scheduling problem (Q1752798) (← links)
• A modified PSO algorithm for minimizing the total costs of resources in MRCPSP (Q1954712) (← links)
• Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem (Q1992769) (← links)
• A distributionally robust analysis of the program evaluation and review technique (Q2030655) (← links)
• A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects (Q2117197) (← links)
• Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem (Q2120134) (← links)
• A polyhedral study of event-based models for the resource-constrained project scheduling problem (Q2173056) (← links)
• An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances (Q2256244) (← links)
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
• An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network (Q3166685) (← links)
• Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach (Q5144773) (← links)
• A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem (Q5246811) (← links)
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
• A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective (Q6568412) (← links)
• An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem (Q6588464) (← links)
• A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty (Q6601552) (← links)