Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
From MaRDI portal
Publication:1909005
Recommendations
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 370525 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Algorithms for Solving Production-Scheduling Problems
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Resource-constrained Project Scheduling — The State of the Art
- Scheduling of Project Networks by Job Assignment
- Scheduling subject to resource constraints: Classification and complexity
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Tabu Search—Part I
- Tabu Search—Part II
Cited in
(23)- scientific article; zbMATH DE number 4174368 (Why is no real title available?)
- Order-based neighborhoods for project scheduling with nonregular objective functions.
- Resource-constrained project scheduling: A critical activity reordering heuristic
- An efficient multi-pass heuristic for project scheduling with constrained resources
- scientific article; zbMATH DE number 2047436 (Why is no real title available?)
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
- Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem
- Case-based reasoning and improved adaptive search for project scheduling
- A random key based genetic algorithm for the resource constrained project scheduling problem
- An adaptive scheduling algorithm for a parallel machine problem with rework processes
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Metaheuristics: A bibliography
- An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem
- Scheduling and constraint propagation
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- A neurogenetic approach for the resource-constrained project scheduling problem
- Tabu search for resource-constrained scheduling
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
This page was built for publication: Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909005)