找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 24141|回復(fù): 40
樓主
發(fā)表于 2025-3-21 16:10:21 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Stochastic Project Networks
副標(biāo)題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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Stochastic Project Networks網(wǎng)絡(luò)公開度




書目名稱Stochastic Project Networks網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Stochastic Project Networks被引頻次




書目名稱Stochastic Project Networks被引頻次學(xué)科排名




書目名稱Stochastic Project Networks年度引用




書目名稱Stochastic Project Networks年度引用學(xué)科排名




書目名稱Stochastic Project Networks讀者反饋




書目名稱Stochastic Project Networks讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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.
板凳
發(fā)表于 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
地板
發(fā)表于 2025-3-22 08:27:54 | 只看該作者
5#
發(fā)表于 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
6#
發(fā)表于 2025-3-22 12:52:17 | 只看該作者
7#
發(fā)表于 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.
8#
發(fā)表于 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
9#
發(fā)表于 2025-3-23 03:26:23 | 只看該作者
10#
發(fā)表于 2025-3-23 06:05:25 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 00:41
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
博客| 康定县| 曲周县| 光泽县| 拉孜县| 闵行区| 安宁市| 肃南| 平邑县| 措美县| 上蔡县| 济源市| 昌邑市| 襄城县| 子洲县| 邯郸县| 高雄县| 略阳县| 西华县| 阿瓦提县| 衡阳县| 沁源县| 玉树县| 桂东县| 锡林郭勒盟| 仁化县| 社旗县| 萝北县| 丰镇市| 昌都县| 西乌珠穆沁旗| 灵台县| 桃江县| 扎囊县| 延川县| 漠河县| 吉水县| 舟山市| 吉安市| 东源县| 绥中县|