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

DOI10.1287/MNSC.38.9.1245zbMath0758.90044OpenAlexW1968409452MaRDI QIDQ4015267

Salah E. Elmaghraby, Jerzy Kamburowski

Publication date: 12 January 1993

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.38.9.1245

zbMATH Keywords

activity networksgeneralized precedence relationsoptimal activity durationscritically of an activityflexibility of an activityuncapacitated minimum cost flow

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (31)

The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production ⋮ Activity nets: A guided tour through some recent developments ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Theory and application of reciprocal transformation of “path problem” and “time float problem” ⋮ A new approach for solving the network problems ⋮ A branch‐and‐bound algorithm for scheduling of new product development projects ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations ⋮ New computational results for the discrete time/cost trade-off problem with time-switch constraints ⋮ Local search algorithms for a single-machine scheduling problem with positive and negative time-lags ⋮ A path enumeration approach for the analysis of critical activities in fuzzy networks ⋮ A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time ⋮ On the complexity of project scheduling to minimize exposed time ⋮ The multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Work Package Sizing and Project Performance ⋮ An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations ⋮ Simplifying activity networks under generalized precedence relations to extended CPM networks ⋮ Audit scheduling with overlapping activities and sequence-dependent setup costs ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound ⋮ Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities ⋮ Maximizing the net present value of a project under uncertainty ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling ⋮ A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations ⋮ Improving project cost estimation by taking into account managerial flexibility

This page was built for publication: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)