An exact algorithm for project scheduling with multiple modes
From MaRDI portal
Publication:1372766
DOI10.1007/BF01545587zbMath0885.90059MaRDI QIDQ1372766
Sönke Hartmann, Arno Sprecher, Andreas Drexl
Publication date: 30 October 1997
Published in: OR Spektrum (Search for Journal in Brave)
Related Items
Multi-mode resource availability cost problem with recruitment and release dates for resources, Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting, A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem, Optimizing resource-constrained project scheduling problem considering the reliability function, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, An analysis of network and resource indicators for resource-constrained project scheduling problem instances, Integrated multi-project planning and scheduling -- a multiagent approach, Project scheduling with finite or infinite number of activity processing modes -- a survey, A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version., A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times, Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem, Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers, Resource-constrained project scheduling: A survey of recent developments., Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting, An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem, A modified PSO algorithm for minimizing the total costs of resources in MRCPSP, Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms, Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure, Considering project management activities for engineering design groups, Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times, Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem, Skilled workforce scheduling in service centres, A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem, Metaheuristics for multi-mode capital-constrained project payment scheduling, An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources, Reactive scheduling in the multi-mode RCPSP, A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem, Maximising the weighted number of activity execution modes in project planning, A robust optimization approach for the multi-mode resource-constrained project scheduling problem, A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting, Project selection, scheduling and resource allocation with time dependent returns, A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling, Resource-constrained project scheduling: Notation, classification, models, and methods, Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective, The multi-mode resource-constrained project scheduling problem with generalized precedence relations, Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP, A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem, An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains, A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem, Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm, A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags, Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization, Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling of project networks
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- A note on ``Hierarchical models for multi-project planning and scheduling
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Resource-constrained project scheduling. Exact methods for the multi-mode case
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Hierarchical models for multi-project planning and scheduling
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Scheduling of Project Networks by Job Assignment
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
