Pages that link to "Item:Q990459"
From MaRDI portal
The following pages link to Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms (Q990459):
Displaying 12 items.
- 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)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← 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)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
- Revenue sharing for resource transfer among projects (Q2027026) (← links)
- Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty (Q2147061) (← links)
- A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← 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)
