Pages that link to "Item:Q4255025"

The following pages link to Local search methods for the discrete time/resource trade-off problem in project networks (Q4255025):

Displaying 15 items.

• MIP models for resource-constrained project scheduling with flexible resource profiles (Q297247) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment (Q744657) (← links)
• Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms (Q990459) (← links)
• A priority-rule method for project scheduling with work-content constraints (Q1046055) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q1807061) (← 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)
• Project selection, scheduling and resource allocation with time dependent returns (Q2519075) (← links)
• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling (Q2519076) (← links)
• On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment (Q4978242) (← links)