A multi-objective resource allocation problem in PERT networks
From MaRDI portal
Publication:2488911
DOI10.1016/j.ejor.2004.11.018zbMath1111.90051MaRDI QIDQ2488911
Masatoshi Sakawa, Amir Azaron, Hideki Katagiri, Kosuke Kato, Azizollah Memariani
Publication date: 16 May 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.11.018
Markov processes; Optimal control; Multiple objective programming; Project management and scheduling
90B50: Management decision making, including multiple objectives
90B35: Deterministic scheduling theory in operations research
90C40: Markov and semi-Markov decision processes
Related Items
Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach, Applying fuzzy method for measuring criticality in project network, Scheduling projects with stochastic activity duration to maximize expected net present value, Lower bound for the mean project completion time in dynamic PERT networks, Mixture densities for project management activity times: A robust approach to PERT
Cites Work
- Unnamed Item
- The use of cutsets in Monte Carlo analysis of stochastic networks
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Optimal resource profiles for program scheduling
- A new structural mechanism for reducibility of stochastic PERT networks
- Optimal control of service rates and arrivals in Jackson networks
- Optimal control of a queueing network system with two types of customers
- Resource allocation via dynamic programming in activity networks
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Estimating critical path and arc probabilities in stochastic activity networks
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Technical Note—Expected Completion Time in Pert Networks
- Access control to two multiserver loss queues in series
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline
- Expected Critical Path Lengths in PERT Networks
- Letter to the Editor—A Modification of Fulkerson's PERT Algorithm
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Distribution of the Time Through a Directed, Acyclic Network
- On the Expected Duration of PERT Type Networks
- Optimum Time Compression in Project Scheduling
- Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
- More on Conditioned Sampling in the Simulation of Stochastic Networks
- Critical Path Problems with Concave Cost-Time Curves
