Scheduling of project networks

DOI10.1007/BF02022042zbMath0693.90046OpenAlexW2031497472MaRDI QIDQ908839

F. J. Radermacher

Publication date: 1985

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02022042

zbMATH Keywords

computational experiencenetwork optimizationbranch-and-bound algorithmsprecedence relationresource constraintsdisjunctive graph conceptfeasible posets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (20)

New strategies for stochastic resource-constrained project scheduling ⋮ Schedule-induced posets ⋮ Minimizing mean flow time with parallel processors and resource constraints ⋮ Advanced DSS for scheduling: Software engineering aspects and the role of eigenmodels ⋮ An exact algorithm for project scheduling with multiple modes ⋮ Robust optimization models for project scheduling with resource availability cost ⋮ Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches ⋮ Mixed multigraph approach to scheduling jobs on machines of different types^∗ ⋮ On the generation of circuits and minimal forbidden sets ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) ⋮ A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation ⋮ Modelling setup times, process batches and transfer batches using activity network logic ⋮ PSPLIB -- a project scheduling problem library ⋮ Resource allocation by means of project networks: Dominance results ⋮ Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic scheduling problems I — General strategies
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Stochastic scheduling problems II-set strategies-
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Project Scheduling with Resource Constraints Using Branch and Bound Methods
• Job-Shop Scheduling by Implicit Enumeration
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems

This page was built for publication: Scheduling of project networks