A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arriv...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Yaghoubi, Saeed [verfasserIn] Noori, Siamak [verfasserIn] Mazdeh, Mohammad Mahdavi [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2013

Umfang:	graph. Darst.

Übergeordnetes Werk:	In: Journal of industrial engineering international - Heidelberg : SpringerOpen, 2005, 9(2013), Seite 1-12
Übergeordnetes Werk:	volume:9 ; year:2013 ; pages:1-12

Links:	Volltext Volltext

DOI / URN:	10.1186/2251-712X-9-17

Katalog-ID:	766146545

Internformat


LEADER	01000caa a2200265 4500
001	766146545
003	DE-627
005	20220715162229.0
007	cr uuu---uuuuu
008	130822s2013 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1186/2251-712X-9-17 \|2 doi
024	7		\|a 10419/147158 \|2 hdl
035			\|a (DE-627)766146545
035			\|a (DE-599)GBV766146545
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
100	1		\|a Yaghoubi, Saeed \|e verfasserin \|4 aut
245	1	2	\|a A heuristic method for consumable resource allocation in multi-class dynamic PERT networks \|c Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh
264		1	\|c 2013
300			\|b graph. Darst.
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.
700	1		\|a Noori, Siamak \|e verfasserin \|4 aut
700	1		\|a Mazdeh, Mohammad Mahdavi \|e verfasserin \|0 (DE-588)1137076631 \|0 (DE-627)894056670 \|0 (DE-576)491102240 \|4 aut
773	0	8	\|i In \|t Journal of industrial engineering international \|d Heidelberg : SpringerOpen, 2005 \|g 9(2013), Seite 1-12 \|h Online-Ressource \|w (DE-627)716633795 \|w (DE-600)2664907-X \|w (DE-576)366431935 \|x 2251-712X \|7 nnns
773	1	8	\|g volume:9 \|g year:2013 \|g pages:1-12
856	4	0	\|u http://hdl.handle.net/10419/147158 \|x Resolving-System \|3 Volltext
856	4	0	\|u http://dx.doi.org/10.1186/2251-712X-9-17 \|x Resolving-System \|3 Volltext
912			\|a GBV_USEFLAG_U
912			\|a GBV_ILN_26
912			\|a ISIL_DE-206
912			\|a SYSFLAG_1
912			\|a GBV_KXP
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
935			\|i zbwolc20131003
951			\|a AR
952			\|d 9 \|j 2013 \|h 1-12
980			\|2 26 \|1 01 \|x 0206 \|b 1429443731 \|y z1k \|z 22-08-13
982			\|2 26 \|1 00 \|x DE-206 \|8 56 \|a Project management
982			\|2 26 \|1 00 \|x DE-206 \|8 56 \|a Multi-class dynamic PERT network
982			\|2 26 \|1 00 \|x DE-206 \|8 56 \|a Queuing

Indexfelder

author_variant	s y sy s n sn m m m mm mmm
matchkey_str	article:2251712X:2013----::huitcehdocnualrsucalctoimlil
hierarchy_sort_str	2013
publishDate	2013
allfields	10.1186/2251-712X-9-17 doi 10419/147158 hdl (DE-627)766146545 (DE-599)GBV766146545 DE-627 ger DE-627 rakwb eng Yaghoubi, Saeed verfasserin aut A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh 2013 graph. Darst. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method. Noori, Siamak verfasserin aut Mazdeh, Mohammad Mahdavi verfasserin (DE-588)1137076631 (DE-627)894056670 (DE-576)491102240 aut In Journal of industrial engineering international Heidelberg : SpringerOpen, 2005 9(2013), Seite 1-12 Online-Ressource (DE-627)716633795 (DE-600)2664907-X (DE-576)366431935 2251-712X nnns volume:9 year:2013 pages:1-12 http://hdl.handle.net/10419/147158 Resolving-System Volltext http://dx.doi.org/10.1186/2251-712X-9-17 Resolving-System Volltext GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2027 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 zbwolc20131003 AR 9 2013 1-12 26 01 0206 1429443731 z1k 22-08-13 26 00 DE-206 56 Project management 26 00 DE-206 56 Multi-class dynamic PERT network 26 00 DE-206 56 Queuing
spelling	10.1186/2251-712X-9-17 doi 10419/147158 hdl (DE-627)766146545 (DE-599)GBV766146545 DE-627 ger DE-627 rakwb eng Yaghoubi, Saeed verfasserin aut A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh 2013 graph. Darst. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method. Noori, Siamak verfasserin aut Mazdeh, Mohammad Mahdavi verfasserin (DE-588)1137076631 (DE-627)894056670 (DE-576)491102240 aut In Journal of industrial engineering international Heidelberg : SpringerOpen, 2005 9(2013), Seite 1-12 Online-Ressource (DE-627)716633795 (DE-600)2664907-X (DE-576)366431935 2251-712X nnns volume:9 year:2013 pages:1-12 http://hdl.handle.net/10419/147158 Resolving-System Volltext http://dx.doi.org/10.1186/2251-712X-9-17 Resolving-System Volltext GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2027 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 zbwolc20131003 AR 9 2013 1-12 26 01 0206 1429443731 z1k 22-08-13 26 00 DE-206 56 Project management 26 00 DE-206 56 Multi-class dynamic PERT network 26 00 DE-206 56 Queuing
allfields_unstemmed	10.1186/2251-712X-9-17 doi 10419/147158 hdl (DE-627)766146545 (DE-599)GBV766146545 DE-627 ger DE-627 rakwb eng Yaghoubi, Saeed verfasserin aut A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh 2013 graph. Darst. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method. Noori, Siamak verfasserin aut Mazdeh, Mohammad Mahdavi verfasserin (DE-588)1137076631 (DE-627)894056670 (DE-576)491102240 aut In Journal of industrial engineering international Heidelberg : SpringerOpen, 2005 9(2013), Seite 1-12 Online-Ressource (DE-627)716633795 (DE-600)2664907-X (DE-576)366431935 2251-712X nnns volume:9 year:2013 pages:1-12 http://hdl.handle.net/10419/147158 Resolving-System Volltext http://dx.doi.org/10.1186/2251-712X-9-17 Resolving-System Volltext GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2027 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 zbwolc20131003 AR 9 2013 1-12 26 01 0206 1429443731 z1k 22-08-13 26 00 DE-206 56 Project management 26 00 DE-206 56 Multi-class dynamic PERT network 26 00 DE-206 56 Queuing
allfieldsGer	10.1186/2251-712X-9-17 doi 10419/147158 hdl (DE-627)766146545 (DE-599)GBV766146545 DE-627 ger DE-627 rakwb eng Yaghoubi, Saeed verfasserin aut A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh 2013 graph. Darst. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method. Noori, Siamak verfasserin aut Mazdeh, Mohammad Mahdavi verfasserin (DE-588)1137076631 (DE-627)894056670 (DE-576)491102240 aut In Journal of industrial engineering international Heidelberg : SpringerOpen, 2005 9(2013), Seite 1-12 Online-Ressource (DE-627)716633795 (DE-600)2664907-X (DE-576)366431935 2251-712X nnns volume:9 year:2013 pages:1-12 http://hdl.handle.net/10419/147158 Resolving-System Volltext http://dx.doi.org/10.1186/2251-712X-9-17 Resolving-System Volltext GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2027 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 zbwolc20131003 AR 9 2013 1-12 26 01 0206 1429443731 z1k 22-08-13 26 00 DE-206 56 Project management 26 00 DE-206 56 Multi-class dynamic PERT network 26 00 DE-206 56 Queuing
allfieldsSound	10.1186/2251-712X-9-17 doi 10419/147158 hdl (DE-627)766146545 (DE-599)GBV766146545 DE-627 ger DE-627 rakwb eng Yaghoubi, Saeed verfasserin aut A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh 2013 graph. Darst. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method. Noori, Siamak verfasserin aut Mazdeh, Mohammad Mahdavi verfasserin (DE-588)1137076631 (DE-627)894056670 (DE-576)491102240 aut In Journal of industrial engineering international Heidelberg : SpringerOpen, 2005 9(2013), Seite 1-12 Online-Ressource (DE-627)716633795 (DE-600)2664907-X (DE-576)366431935 2251-712X nnns volume:9 year:2013 pages:1-12 http://hdl.handle.net/10419/147158 Resolving-System Volltext http://dx.doi.org/10.1186/2251-712X-9-17 Resolving-System Volltext GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2027 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 zbwolc20131003 AR 9 2013 1-12 26 01 0206 1429443731 z1k 22-08-13 26 00 DE-206 56 Project management 26 00 DE-206 56 Multi-class dynamic PERT network 26 00 DE-206 56 Queuing
language	English
source	In Journal of industrial engineering international 9(2013), Seite 1-12 volume:9 year:2013 pages:1-12
sourceStr	In Journal of industrial engineering international 9(2013), Seite 1-12 volume:9 year:2013 pages:1-12
format_phy_str_mv	Article
building	26:1
institution	findex.gbv.de
selectbib_iln_str_mv	26@1k
sw_local_iln_str_mv	26:Project management DE-206:Project management 26:Multi-class dynamic PERT network DE-206:Multi-class dynamic PERT network 26:Queuing DE-206:Queuing
isfreeaccess_bool	false
container_title	Journal of industrial engineering international
authorswithroles_txt_mv	Yaghoubi, Saeed @@aut@@ Noori, Siamak @@aut@@ Mazdeh, Mohammad Mahdavi @@aut@@
publishDateDaySort_date	2013-01-01T00:00:00Z
hierarchy_top_id	716633795
id	766146545
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">766146545</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220715162229.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">130822s2013 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1186/2251-712X-9-17</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10419/147158</subfield><subfield code="2">hdl</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)766146545</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV766146545</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yaghoubi, Saeed</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A heuristic method for consumable resource allocation in multi-class dynamic PERT networks</subfield><subfield code="c">Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Noori, Siamak</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mazdeh, Mohammad Mahdavi</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1137076631</subfield><subfield code="0">(DE-627)894056670</subfield><subfield code="0">(DE-576)491102240</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of industrial engineering international</subfield><subfield code="d">Heidelberg : SpringerOpen, 2005</subfield><subfield code="g">9(2013), Seite 1-12</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)716633795</subfield><subfield code="w">(DE-600)2664907-X</subfield><subfield code="w">(DE-576)366431935</subfield><subfield code="x">2251-712X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:2013</subfield><subfield code="g">pages:1-12</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://hdl.handle.net/10419/147158</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1186/2251-712X-9-17</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="935" ind1=" " ind2=" "><subfield code="i">zbwolc20131003</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">2013</subfield><subfield code="h">1-12</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">1429443731</subfield><subfield code="y">z1k</subfield><subfield code="z">22-08-13</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Project management</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Multi-class dynamic PERT network</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Queuing</subfield></datafield></record></collection>
author	Yaghoubi, Saeed
spellingShingle	Yaghoubi, Saeed 26 Project management 26 Multi-class dynamic PERT network 26 Queuing A heuristic method for consumable resource allocation in multi-class dynamic PERT networks
authorStr	Yaghoubi, Saeed
ppnlink_with_tag_str_mv	@@773@@(DE-627)716633795
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
typewithnormlink_str_mv	DifferentiatedPerson@(DE-588)1137076631 Person@(DE-588)1137076631
collection	KXP GVK SWB
remote_str	true
last_changed_iln_str_mv	26@22-08-13
illustrated	Not Illustrated
issn	2251-712X
topic_title	26 00 DE-206 56 Project management 26 00 DE-206 56 Multi-class dynamic PERT network 26 00 DE-206 56 Queuing A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh
topic	26 Project management 26 Multi-class dynamic PERT network 26 Queuing
topic_unstemmed	26 Project management 26 Multi-class dynamic PERT network 26 Queuing
topic_browse	26 Project management 26 Multi-class dynamic PERT network 26 Queuing
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of industrial engineering international
normlinkwithtype_str_mv	(DE-588)1137076631@DifferentiatedPerson (DE-588)1137076631@Person
hierarchy_parent_id	716633795
hierarchy_top_title	Journal of industrial engineering international
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)716633795 (DE-600)2664907-X (DE-576)366431935
normlinkwithrole_str_mv	(DE-588)1137076631@@aut@@
title	A heuristic method for consumable resource allocation in multi-class dynamic PERT networks
ctrlnum	(DE-627)766146545 (DE-599)GBV766146545
title_full	A heuristic method for consumable resource allocation in multi-class dynamic PERT networks Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh
author_sort	Yaghoubi, Saeed
journal	Journal of industrial engineering international
journalStr	Journal of industrial engineering international
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2013
contenttype_str_mv	txt
container_start_page	1
author_browse	Yaghoubi, Saeed Noori, Siamak Mazdeh, Mohammad Mahdavi
selectkey	26:z
container_volume	9
physical	graph. Darst.
format_se	Elektronische Aufsätze
author-letter	Yaghoubi, Saeed
doi_str_mv	10.1186/2251-712X-9-17
normlink	1137076631 894056670 491102240
normlink_prefix_str_mv	(DE-588)1137076631 (DE-627)894056670 (DE-576)491102240
author2-role	verfasserin
title_sort	heuristic method for consumable resource allocation in multi-class dynamic pert networks
title_auth	A heuristic method for consumable resource allocation in multi-class dynamic PERT networks
abstract	This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.
abstractGer	This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.
abstract_unstemmed	This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.
collection_details	GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2027 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	A heuristic method for consumable resource allocation in multi-class dynamic PERT networks
url	http://hdl.handle.net/10419/147158 http://dx.doi.org/10.1186/2251-712X-9-17
ausleihindikator_str_mv	26
rolewithnormlink_str_mv	@@aut@@(DE-588)1137076631
remote_bool	true
author2	Noori, Siamak Mazdeh, Mohammad Mahdavi
author2Str	Noori, Siamak Mazdeh, Mohammad Mahdavi
ppnlink	716633795
GND_str_mv	Mahdavi Mazdeh, Mohammad Mazdeh, Mohammad Mahdavi
GND_txt_mv	Mahdavi Mazdeh, Mohammad Mazdeh, Mohammad Mahdavi
GND_txtF_mv	Mahdavi Mazdeh, Mohammad Mazdeh, Mohammad Mahdavi
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1186/2251-712X-9-17
up_date	2024-07-04T07:43:26.809Z
_version_	1803633564641656832
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">766146545</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220715162229.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">130822s2013 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1186/2251-712X-9-17</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10419/147158</subfield><subfield code="2">hdl</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)766146545</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV766146545</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yaghoubi, Saeed</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A heuristic method for consumable resource allocation in multi-class dynamic PERT networks</subfield><subfield code="c">Saeed Yaghoubi, Siamak Noori and Mohammad Mazdeh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Noori, Siamak</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mazdeh, Mohammad Mahdavi</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1137076631</subfield><subfield code="0">(DE-627)894056670</subfield><subfield code="0">(DE-576)491102240</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of industrial engineering international</subfield><subfield code="d">Heidelberg : SpringerOpen, 2005</subfield><subfield code="g">9(2013), Seite 1-12</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)716633795</subfield><subfield code="w">(DE-600)2664907-X</subfield><subfield code="w">(DE-576)366431935</subfield><subfield code="x">2251-712X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:2013</subfield><subfield code="g">pages:1-12</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://hdl.handle.net/10419/147158</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1186/2251-712X-9-17</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="935" ind1=" " ind2=" "><subfield code="i">zbwolc20131003</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">2013</subfield><subfield code="h">1-12</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">1429443731</subfield><subfield code="y">z1k</subfield><subfield code="z">22-08-13</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Project management</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Multi-class dynamic PERT network</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Queuing</subfield></datafield></record></collection>
score	7.3986187

Nicht das Richtige dabei?

Schreiben Sie uns!

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?