找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Stochastic Project Networks; Temporal Analysis, S Klaus Neumann Book 1990 Springer-Verlag Berlin Heidelberg 1990 Graph.Markov chain.Markov

[复制链接]
查看: 24098|回复: 40
发表于 2025-3-21 16:10:21 | 显示全部楼层 |阅读模式
书目名称Stochastic Project Networks
副标题Temporal Analysis, S
编辑Klaus Neumann
视频videohttp://file.papertrans.cn/879/878151/878151.mp4
丛书名称Lecture Notes in Economics and Mathematical Systems
图书封面Titlebook: Stochastic Project Networks; Temporal Analysis, S Klaus Neumann Book 1990 Springer-Verlag Berlin Heidelberg 1990 Graph.Markov chain.Markov
描述Project planning, scheduling, and control are regularly used in business and the service sector of an economy to accomplish outcomes with limited resources under critical time constraints. To aid in solving these problems, network-based planning methods have been developed that now exist in a wide variety of forms, cf. Elmaghraby (1977) and Moder et al. (1983). The so-called "classical" project networks, which are used in the network techniques CPM and PERT and which represent acyclic weighted directed graphs, are able to describe only projects whose evolution in time is uniquely specified in advance. Here every event of the project is realized exactly once during a single project execution and it is not possible to return to activities previously carried out (that is, no feedback is permitted). Many practical projects, however, do not meet those conditions. Consider, for example, a production process where some parts produced by a machine may be poorly manufactured. If an inspection shows that a part does not conform to certain specifications, it must be repaired or replaced by a new item. This means that we have to return to a preceding stage of the production process. In other w
出版日期Book 1990
关键词Graph; Markov chain; Markov renewal process; Networks; Netzwerk; Project Planning; Projektmanagement; Stoch
版次1
doihttps://doi.org/10.1007/978-3-642-61515-3
isbn_softcover978-3-540-52664-3
isbn_ebook978-3-642-61515-3Series ISSN 0075-8442 Series E-ISSN 2196-9957
issn_series 0075-8442
copyrightSpringer-Verlag Berlin Heidelberg 1990
The information of publication is updating

书目名称Stochastic Project Networks影响因子(影响力)




书目名称Stochastic Project Networks影响因子(影响力)学科排名




书目名称Stochastic Project Networks网络公开度




书目名称Stochastic Project Networks网络公开度学科排名




书目名称Stochastic Project Networks被引频次




书目名称Stochastic Project Networks被引频次学科排名




书目名称Stochastic Project Networks年度引用




书目名称Stochastic Project Networks年度引用学科排名




书目名称Stochastic Project Networks读者反馈




书目名称Stochastic Project Networks读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:56:11 | 显示全部楼层
Cost Minimization for STEOR and EOR Networks, in each STEOR network from a covering of N that contains all nodes from .(j) and all arcs joining those nodes (cf. (3.5.10)), the cost minimization problem for admissible EOR networks of Markov degree d >1 can be solved in the same manner as for STEOR networks.
发表于 2025-3-22 04:17:05 | 显示全部楼层
0075-8442 mited resources under critical time constraints. To aid in solving these problems, network-based planning methods have been developed that now exist in a wide variety of forms, cf. Elmaghraby (1977) and Moder et al. (1983). The so-called "classical" project networks, which are used in the network te
发表于 2025-3-22 08:27:54 | 显示全部楼层
发表于 2025-3-22 09:42:22 | 显示全部楼层
Book 1990urces under critical time constraints. To aid in solving these problems, network-based planning methods have been developed that now exist in a wide variety of forms, cf. Elmaghraby (1977) and Moder et al. (1983). The so-called "classical" project networks, which are used in the network techniques C
发表于 2025-3-22 12:52:17 | 显示全部楼层
发表于 2025-3-22 19:14:58 | 显示全部楼层
STEOR Networks and EOR Networks,arkov renewal processes can be associated with those networks. In particular, STEOR networks satisfy the one-sink condition. Exploiting some results from the theory of Markov renewal processes, an efficient method for computing the activation functions Y. can be found.
发表于 2025-3-22 22:18:52 | 显示全部楼层
Reducible GERT Networks,entrance, however, cause some difficulties. Therefore, it suggests itself to investigate GERT networks all of whose AND nodes and IOR nodes lie inside special subnetworks which can be reduced to structures containing only STEOR nodes. Obviously, the reduction of those subnetworks to “STEOR subnetwor
发表于 2025-3-23 03:26:23 | 显示全部楼层
发表于 2025-3-23 06:05:25 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-13 11:34
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表