Pages that link to "Item:Q1399573"

The following pages link to A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. (Q1399573):

Displaying 29 items.

• Metaheuristics for multi-mode capital-constrained project payment scheduling (Q2253378) (← 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)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• A survey of hybrid metaheuristics for the resource-constrained project scheduling problem (Q2273894) (← links)
• Probability mechanism based particle swarm optimization algorithm and its application in resource-constrained project scheduling problems (Q2296600) (← links)
• Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting (Q2432851) (← links)
• A hybrid metaheuristic for the resource-constrained project scheduling problem (Q2433434) (← links)
• A hybrid genetic algorithm for the resource-constrained project scheduling problem (Q2455614) (← links)
• A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems (Q2467429) (← links)
• Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem (Q2482379) (← links)
• Simulated annealing heuristics for the dynamic facility layout problem (Q2489299) (← links)
• Project selection, scheduling and resource allocation with time dependent returns (Q2519075) (← links)
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling (Q2570161) (← links)
• Multi-mode resource constrained multi-project scheduling and resource portfolio problem (Q2629594) (← links)
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
• A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem (Q2893339) (← links)
• New representation to reduce the search space for the resource-constrained project scheduling problem (Q3539808) (← links)
• A simulated annealing algorithm for resource constrained project scheduling problems (Q4346456) (← links)
• Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling Problem (Q5162162) (← links)
• An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains (Q5244304) (← links)
• A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem (Q5246811) (← links)
• A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem (Q5438568) (← links)
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
• A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem (Q6106590) (← links)
• A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective (Q6568412) (← links)
• An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem (Q6588464) (← links)
• Solving a real-life multi-skill resource-constrained multi-project scheduling problem (Q6588468) (← links)
• Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns (Q6588469) (← links)