Pages that link to "Item:Q2519076"

The following pages link to A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling (Q2519076):

Displaying 33 items.

• MIP models for resource-constrained project scheduling with flexible resource profiles (Q297247) (← links)
• Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars (Q322689) (← links)
• Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project (Q322744) (← 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)
• An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem (Q433107) (← 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)
• A neurogenetic approach for the resource-constrained project scheduling problem (Q709106) (← links)
• Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment (Q744657) (← 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)
• Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
• A priority-rule method for project scheduling with work-content constraints (Q1046055) (← links)
• A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
• Multi-mode resource availability cost problem with recruitment and release dates for resources (Q1634132) (← links)
• A branch and bound algorithm for project scheduling problem with spatial resource constraints (Q1666182) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• An efficient particle swarm optimizer with application to man-day project scheduling problems (Q1718586) (← 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 modified PSO algorithm for minimizing the total costs of resources in MRCPSP (Q1954712) (← links)
• Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty (Q2147061) (← links)
• Considering project management activities for engineering design groups (Q2226486) (← links)
• An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances (Q2256244) (← links)
• A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem (Q2270291) (← links)
• A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← links)
• Energetic reasoning for energy-constrained scheduling with a continuous resource (Q2356117) (← links)
• Integrated multi-project planning and scheduling -- a multiagent approach (Q2672092) (← links)
• On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment (Q4978242) (← links)
• Robust Capacity Planning for Project Management (Q5084614) (← 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)
• An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem (Q6588464) (← links)