Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
From MaRDI portal
Publication:1427560
DOI10.1016/S0377-2217(02)00884-6zbMath1045.90028OpenAlexW1974300423WikidataQ57254148 ScholiaQ57254148MaRDI QIDQ1427560
Khalil S. Hindi, Krzysztof Fleszar
Publication date: 14 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00884-6
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (26)
Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling ⋮ Solving the unconstrained optimization problem by a variable neighborhood search ⋮ Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ Performance analysis of active schedules in identical parallel machine ⋮ Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements ⋮ A hybrid genetic algorithm for the resource-constrained project scheduling problem ⋮ A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem ⋮ PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ Solving the resource-constrained project scheduling problem using filter-and-fan approach ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Towards merging binary integer programming techniques with genetic algorithms ⋮ A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem ⋮ Variable neighbourhood search: methods and applications ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ A survey of hybrid metaheuristics for the resource-constrained project scheduling problem ⋮ Probability mechanism based particle swarm optimization algorithm and its application in resource-constrained project scheduling problems ⋮ COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ Variable neighbourhood search: Methods and applications ⋮ Activity list representation for a generalization of the resource-constrained project scheduling problem ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments ⋮ A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling subject to resource constraints: Classification and complexity
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- PSPLIB -- a project scheduling problem library
- Variable neighborhood search
- Problem space search algorithms for resource-constrained project scheduling
- Resource-constrained project scheduling: A survey of recent developments.
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- New computational results on the discrete time/cost trade-off problem in project networks
This page was built for publication: Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
