Stochastic Project Networks: Temporal Analysis, Scheduling and Cost Minimization: Lecture Notes in Economics and Mathematical Systems, cartea 344
Autor Klaus Neumannen Limba Engleză Paperback – 10 iul 1990
Din seria Lecture Notes in Economics and Mathematical Systems
- Preț: 360.02 lei
- Preț: 279.18 lei
- Preț: 363.80 lei
- Preț: 363.96 lei
- Preț: 360.14 lei
- Preț: 422.54 lei
- Preț: 471.23 lei
- Preț: 360.87 lei
- Preț: 364.69 lei
- Preț: 358.26 lei
- Preț: 378.71 lei
- 20% Preț: 341.74 lei
- 15% Preț: 609.22 lei
- Preț: 358.97 lei
- Preț: 404.74 lei
- Preț: 365.41 lei
- 15% Preț: 610.06 lei
- Preț: 359.24 lei
- Preț: 327.43 lei
- Preț: 403.45 lei
- Preț: 358.50 lei
- 18% Preț: 734.66 lei
- Preț: 372.00 lei
- Preț: 380.56 lei
- 15% Preț: 612.34 lei
- Preț: 362.16 lei
- Preț: 358.50 lei
- 15% Preț: 603.96 lei
- 15% Preț: 613.12 lei
- Preț: 357.93 lei
- Preț: 424.32 lei
- 15% Preț: 610.49 lei
- Preț: 365.78 lei
- 15% Preț: 619.90 lei
- Preț: 393.24 lei
- Preț: 389.95 lei
- Preț: 377.99 lei
- Preț: 377.99 lei
- Preț: 372.17 lei
- 15% Preț: 601.94 lei
- 20% Preț: 619.07 lei
- Preț: 359.70 lei
- Preț: 469.42 lei
- Preț: 424.48 lei
- Preț: 358.87 lei
- 15% Preț: 603.53 lei
- Preț: 365.61 lei
- Preț: 358.70 lei
- 15% Preț: 631.39 lei
Preț: 365.52 lei
Nou
Puncte Express: 548
Preț estimativ în valută:
69.97€ • 75.23$ • 58.33£
69.97€ • 75.23$ • 58.33£
Carte tipărită la comandă
Livrare economică 19 decembrie 24 - 02 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540526643
ISBN-10: 3540526641
Pagini: 260
Ilustrații: XI, 237 p.
Dimensiuni: 170 x 242 x 14 mm
Greutate: 0.37 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Economics and Mathematical Systems
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540526641
Pagini: 260
Ilustrații: XI, 237 p.
Dimensiuni: 170 x 242 x 14 mm
Greutate: 0.37 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Economics and Mathematical Systems
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
1 Basic Concepts.- 1.1 Directed Graphs and Project Networks.- 1.2 GERT Networks.- 1.3 Assumptions and Structural Problems.- 1.4 Complete and GERT Subnetworks.- 2 Temporal Analysis of GERT Networks.- 2.1 Activation Functions and Activation Distributions.- 2.2 Evaluation of Admissible GERT Networks.- 2.3 Computation of Some Quantities Important to Time Planning.- 2.4 Evaluation Methods for Admissible GERT Networks.- 3 STEOR Networks and EOR Networks.- 3.1 Markov Chains and Markov Renewal Processes.- 3.2 STEOR Networks and Markov Renewal Processes.- 3.3 Basic Properties of Admissible EOR Networks.- 3.4 Coverings of Admissible EOR Networks.- 3.5 Properties and Computation of Activation Functions and Activation Numbers.- 3.6 The MRP Method.- 4 Reducible GERT Networks.- 4.1 STEOR—Reducible Subnetworks.- 4.2 Cycle Reduction.- 4.3 Nodes Which Belong Together.- 4.4 Basic Element Structures.- 4.5 BES Networks.- 4.6 Evaluation Methods for BES Networks and General Admissible GERT Networks.- 5 Scheduling with GERT Precedence Constraints.- 5.1 Deterministic Single—Machine Scheduling.- 5.2 Stochastic Single—Machine Scheduling with GERT Precedence Constraints: Basic Concepts.- 5.3 Stochastic Single—Machine Scheduling with GERT Precedence Constraints: Optimality Criteria and Complexity.- 5.4 List Schedules and Sequences of Activity Executions.- 5.5 Minimum Flow—Time Scheduling in FOR Networks.- 5.6 A Flow—Time Scheduling Example.- 5.7 Minimizing the Maximum Expected Lateness in FOR Networks.- 5.8 Essential Histories and Scheduling Policies for Min—Sum Problems in General GERT Networks.- 5.9 Elements of Dynamic Programming.- 5.10 Determination of an Optimal Scheduling Policy for the General Min—Sum Problem.- 6 Cost Minimization for STEOR and FOR Networks.- 6.1 STEORNetworks with Time—Dependent Arc Weights.- 6.2 Cost Minimization in STEOR Networks: Basic Concepts.- 6.3 A Dynamic Programming Approach.- 6.4 The Value—Iteration and Policy—Iteration Techniques.- 7 Cost and Time Minimization for Decision Project Networks.- 7.1 Decision Project Networks.- 7.2 Cost Minimization.- 7.3 Randomized Actions.- 7.4 Multiple Executions of Projects.- 7.5 Time Minimization.- References.