Pages that link to "Item:Q1808195"
From MaRDI portal
The following pages link to Experience with fine-grained parallel genetic algorithms (Q1808195):
Displayed 12 items.
- New concepts for activity float in resource-constrained project management (Q622136) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Experimental investigation of heuristics for resource-constrained project scheduling: an update (Q858327) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- Activity list representation for a generalization of the resource-constrained project scheduling problem (Q1042097) (← links)
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. (Q1399573) (← links)
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem (Q1590044) (← links)
- Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem (Q2482379) (← links)
- New representation to reduce the search space for the resource-constrained project scheduling problem (Q3539808) (← links)