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.01 lei
- Preț: 279.17 lei
- Preț: 373.00 lei
- Preț: 373.18 lei
- Preț: 369.25 lei
- Preț: 433.55 lei
- Preț: 483.18 lei
- Preț: 370.01 lei
- Preț: 373.92 lei
- Preț: 367.56 lei
- Preț: 388.29 lei
- 20% Preț: 350.64 lei
- 15% Preț: 624.74 lei
- Preț: 368.32 lei
- Preț: 404.73 lei
- Preț: 374.65 lei
- 15% Preț: 626.03 lei
- Preț: 368.32 lei
- Preț: 335.71 lei
- Preț: 413.66 lei
- Preț: 367.56 lei
- 18% Preț: 753.41 lei
- Preț: 381.41 lei
- Preț: 390.19 lei
- 15% Preț: 627.93 lei
- Preț: 371.31 lei
- Preț: 367.56 lei
- 15% Preț: 619.34 lei
- 15% Preț: 628.73 lei
- Preț: 367.00 lei
- Preț: 435.08 lei
- 15% Preț: 626.03 lei
- Preț: 375.03 lei
- 15% Preț: 635.70 lei
- Preț: 403.19 lei
- Preț: 399.81 lei
- Preț: 387.56 lei
- Preț: 387.56 lei
- Preț: 381.57 lei
- 15% Preț: 617.28 lei
- 20% Preț: 634.85 lei
- Preț: 369.05 lei
- Preț: 481.33 lei
- Preț: 435.24 lei
- Preț: 367.95 lei
- 15% Preț: 618.89 lei
- Preț: 374.87 lei
- Preț: 367.77 lei
- 15% Preț: 647.47 lei
Preț: 375.03 lei
Nou
Puncte Express: 563
Preț estimativ în valută:
71.78€ • 74.81$ • 59.75£
71.78€ • 74.81$ • 59.75£
Carte tipărită la comandă
Livrare economică 06-20 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.