Lower bound for the mean project completion time in dynamic PERT networks
Year of publication: |
2008
|
---|---|
Authors: | Azaron, Amir ; Fatemi Ghomi, S. M. T. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 186.2008, 1, p. 120-127
|
Subject: | Projektmanagement | Project management | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Pattern mining-based pruning strategies in stochastic local searches for scheduling problems
Laurent, Arnaud, (2022)
-
Optimisation of critical chain sequencing based on activities' information flow interactions
Zhang, Junguang, (2015)
-
Resource-constrained project scheduling with concave processing rate functions
Steeneck, Daniel W., (2015)
- More ...
-
Optimal control of service rates and arrivals in Jackson networks
Azaron, Amir, (2003)
-
An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process
Eghbali‐Zarch, Maryam, (2021)
-
Distribution function of the shortest path in networks of queues
Azaron, Amir, (2005)
- More ...