Pages that link to "Item:Q1427560"

The following pages link to Solving the resource-constrained project scheduling problem by a variable neighbourhood search. (Q1427560):

Displaying 35 items.

• A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling (Q342339) (← links)
• An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search (Q702729) (← links)
• Experimental investigation of heuristics for resource-constrained project scheduling: an update (Q858327) (← links)
• Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
• Solving the resource-constrained project scheduling problem using filter-and-fan approach (Q945251) (← links)
• A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
• A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← links)
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Activity list representation for a generalization of the resource-constrained project scheduling problem (Q1042097) (← links)
• A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← links)
• Towards merging binary integer programming techniques with genetic algorithms (Q1748518) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← 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)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• A hybrid genetic algorithm for the resource-constrained project scheduling problem (Q2455614) (← links)
• Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem (Q2482379) (← links)
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling (Q2570161) (← links)
• COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS (Q3392298) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• Performance analysis of active schedules in identical parallel machine (Q3517880) (← links)
• New representation to reduce the search space for the resource-constrained project scheduling problem (Q3539808) (← links)
• (Q4451582) (← links)
• Adaptive search for solving hard project scheduling problems (Q5687896) (← links)
• PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS (Q5708845) (← links)
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
• A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times (Q6109310) (← 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)
• Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays (Q6621638) (← links)