Resource-constrained project scheduling: A survey of recent developments. (Q1406618): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:39, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Resource-constrained project scheduling: A survey of recent developments.	scientific article

Statements

scholarly article

0 references

Resource-constrained project scheduling: A survey of recent developments. (English)

0 references

Computers \& Operations Research

0 references

publication date

7 September 2003

0 references

Willy S. Herroelen

0 references

0 references

Erik L. Demeulemeester

0 references

describes a project that uses

0 references

MaRDI profile type

0 references

0 references

Sequencing theory

0 references

On general routing problems

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Scheduling research in multiple resource constrained job shops: a review and critique

0 references

Scheduling subject to resource constraints: Classification and complexity

0 references

The Schedule-Sequencing Problem

0 references

A Horizon-Varying, Zero-One Approach to Project Scheduling

0 references

A decomposition approach to multi-project scheduling

0 references

Solving the resource constrained project scheduling problem with optimization subroutine library

0 references

Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

0 references

An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints

0 references

An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems

0 references

Scheduling of project networks

0 references

Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer

0 references

0 references

Solving resource-constrained project scheduling problems by a* search

0 references

Une méthode arborescente pour résoudre les problèmes cumulatifs

0 references

A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem

0 references

New Benchmark Results for the Resource-Constrained Project Scheduling Problem

0 references

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

0 references

A branch and bound algorithm for the resource-constrained project scheduling problem

0 references

Resource-constrained Project Scheduling — The State of the Art

0 references

Activity nets: A guided tour through some recent developments

0 references

Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

0 references

On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem

0 references

Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm

0 references

PSPLIB -- a project scheduling problem library

0 references

On the use of the complexity index as a measure of complexity in activity networks

0 references

Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case

0 references

On the measurement of complexity in activity networks

0 references

Optimal Reduction of Two-Terminal Directed Acyclic Graphs

0 references

0 references

An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques

0 references

On Dynamic Programming Methods for Assembly Line Balancing

0 references

Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation

0 references

Project scheduling: The effects of problem structure on heuristic performance

0 references

Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study

0 references

Project Scheduling with Continuously-Divisible, Doubly Constrained Resources

0 references

An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

0 references

A multiple-tree search procedure for the resource-constrained project scheduling problem

0 references

Heuristics for scheduling resource-constrained projects in MPM networks

0 references

One-machine generalized precedence constrained scheduling problems

0 references

The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)

0 references

A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

0 references

Project network models with discounted cash flows a guided tour through recent developments

0 references

Cash Flows in Networks

0 references

The payment scheduling problem

0 references

The scheduling of activities to maximize the net present value of projects

0 references

Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects

0 references

Phase transitions in project scheduling

0 references

A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows

0 references

Scheduling a project to maximize its net present value: An integer programming approach

0 references

An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations

0 references

0 references

New computational results on the discrete time/cost trade-off problem in project networks

0 references

Local search methods for the discrete time/resource trade-off problem in project networks

0 references

An exact algorithm for project scheduling with multiple modes

0 references

Hierarchical models for multi-project planning and scheduling

0 references

Resource-constrained project scheduling. Exact methods for the multi-mode case

0 references

A note on ``Hierarchical models for multi-project planning and scheduling''

0 references

Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems

0 references

full work available at URL

https://doi.org/10.1016/s0305-0548(97)00055-5

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0305-0548(97)00055-5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1406618

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1406618&oldid=37318812"