Pages that link to "Item:Q2268503"

The following pages link to Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503):

Displaying 19 items.

• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
• Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Stable multi-skill workforce assignments (Q744637) (← links)
• Minimizing average project team size given multi-skilled workers with heterogeneous skill levels (Q1651635) (← links)
• A biased random-key genetic algorithm for the project scheduling problem with flexible resources (Q1667401) (← links)
• New model and heuristics for safety stock placement in general acyclic supply chain networks (Q1762120) (← links)
• A new algorithm for resource-constrained project scheduling with breadth and depth of skills (Q2030541) (← links)
• Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem (Q2120134) (← links)
• An improved MIP-based approach for a multi-skill workforce scheduling problem (Q2434289) (← links)
• Multi-project scheduling problem under shared multi-skill resource constraints (Q2701180) (← links)
• Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates (Q5214337) (← links)
• Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption (Q6056166) (← links)
• Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison (Q6088125) (← links)
• Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
• New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem (Q6102886) (← links)
• On the complexity of efficient multi-skilled team composition (Q6106584) (← links)
• Tabu search for proactive project scheduling problem with flexible resources (Q6164385) (← links)