Pages that link to "Item:Q702729"
From MaRDI portal
The following pages link to LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search (Q702729):
Displayed 33 items.
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling (Q342339) (← links)
- Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources (Q513559) (← links)
- Applying local rescheduling in response to schedule disruptions (Q613784) (← links)
- Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
- Time-constrained project scheduling with adjacent resources (Q709144) (← links)
- Time-constrained project scheduling (Q835591) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- Experimental investigation of heuristics for resource-constrained project scheduling: an update (Q858327) (← links)
- Two local search approaches for solving real-life car sequencing problems (Q932212) (← links)
- A constraint programming approach for the resource-constrained project scheduling problem (Q940840) (← 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)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
- Towards merging binary integer programming techniques with genetic algorithms (Q1748518) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem (Q2273894) (← links)
- A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem (Q2355885) (← 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)
- 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)
- A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem (Q2893339) (← links)
- Models and methods for frequency assignment with cumulative interference constraints (Q3499441) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
- (Q5878630) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
- Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption (Q6056166) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
- An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem (Q6090759) (← links)
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem (Q6160231) (← links)