Time-cost trade-off via optimal control theory in Markov PERT networks (Q2480200)

From MaRDI portal

Revision as of 20:31, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Time-cost trade-off via optimal control theory in Markov PERT networks	scientific article

Statements

scholarly article

0 references

Time-cost trade-off via optimal control theory in Markov PERT networks (English)

0 references

0 references

Hideki Katagiri

0 references

Masatoshi Sakawa

0 references

Annals of Operations Research

0 references

publication date

31 March 2008

0 references

zbMATH Keywords

project management

0 references

multiple objective programming

0 references

optimal control theory

0 references

Markov processes

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-006-0149-x

0 references

Optimal control of service rates and arrivals in Jackson networks

0 references

Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis

0 references

Critical Path Analyses Via Chance Constrained and Stochastic Programming

0 references

Letter to the Editor—A Modification of Fulkerson's PERT Algorithm

0 references

Optimal procedures for the discrete time/cost trade-off problem in project networks

0 references

On the Expected Duration of PERT Type Networks

0 references

Resource allocation via dynamic programming in activity networks

0 references

Critical Path Problems with Concave Cost-Time Curves

0 references

A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network

0 references

A new structural mechanism for reducibility of stochastic PERT networks

0 references

Estimating critical path and arc probabilities in stochastic activity networks

0 references

A Network Flow Computation for Project Cost Curves

0 references

Expected Critical Path Lengths in PERT Networks

0 references

More on Conditioned Sampling in the Simulation of Stochastic Networks

0 references

Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon

0 references

Access control to two multiserver loss queues in series

0 references

Critical-Path Planning and Scheduling: Mathematical Basis

0 references

Markov and Markov-Regenerative <scp>pert</scp> Networks

0 references

Optimum Time Compression in Project Scheduling

0 references

0 references

Distribution of the Time Through a Directed, Acyclic Network

0 references

Technical Note—Expected Completion Time in Pert Networks

0 references

A Dynamic Programming Solution to Cost-Time Tradeoff for CPM

0 references

A Tutorial On Optimal Control Theory

0 references

The use of cutsets in Monte Carlo analysis of stochastic networks

0 references

The exact overall time distribution of a project with uncertain task durations

0 references

Optimal control of a queueing network system with two types of customers

0 references

Optimal resource profiles for program scheduling

0 references

Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline

0 references

Project Scheduling with Continuously-Divisible, Doubly Constrained Resources

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10479-006-0149-x

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:2480200

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