Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
From MaRDI portal
Publication:2277354
DOI10.1007/BF01719929zbMath0725.90040MaRDI QIDQ2277354
Wolfgang Domschke, Andreas Drexl
Publication date: 1991
Published in: OR Spektrum (Search for Journal in Brave)
Project schedulingnon-preemptive time/cost/resource-tradeoff modelspreemptive modelsrenewable, nonrenewable and doubly-constrained resources
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (10)
Application of facility location modeling constructs to vendor selection problems ⋮ Model-based inference in CHARME. ⋮ An algorithm for solving large capacitated warehouse location problems ⋮ Optimal sizes of facilities on a linear market ⋮ Competitive spatial models ⋮ Allocation of partially renewable resources: Concept, capabilities, and applications ⋮ Operations research activities in Germany ⋮ Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen Güterfernverkehr. (Concepts of genetic algorithms and their application to the freight optimization problem of distant commercial goods transportation) ⋮ Lagrangean heuristics for location problems ⋮ ADD-heuristics' starting procedures for capacitated plant location models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling of project networks
- Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- GERT networks and the time-oriented evaluation of projects
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Scheduling of Project Networks by Job Assignment
- Some Results Concerning the Estimation of Beta Distribution Parameters in PERT
- On the Distribution of Activity Time in PERT
- Preemptive scheduling with staircase and piecewise linear resource availability
- Project Scheduling with Discrete and Continuous Resources
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Multi-Project Scheduling: Categorization of Heuristic Rules Performance
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Multiple Allocation Of Resources In A Network An Optimal Scheduling Algorithm*
- Cash Flows in Networks
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
This page was built for publication: Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
