Skip to main content
SpringerLink
Log in
Book cover

Stochastic Project Networks

Temporal Analysis, Scheduling and Cost Minimization

  • Book
  • © 1990

Overview

Authors:
  1. Klaus Neumann

    1. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, Karlsruhe 1, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 344)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Basic Concepts

    • Klaus Neumann
    Pages 1-36

  3. Temporal Analysis of GERT Networks

    • Klaus Neumann
    Pages 37-55

  4. STEOR Networks and EOR Networks

    • Klaus Neumann
    Pages 56-94

  5. Reducible GERT Networks

    • Klaus Neumann
    Pages 95-115

  6. Scheduling with GERT Precedence Constraints

    • Klaus Neumann
    Pages 116-175

  7. Cost Minimization for STEOR and EOR Networks

    • Klaus Neumann
    Pages 176-197

  8. Cost and Time Minimization for Decision Project Networks

    • Klaus Neumann
    Pages 198-226

  9. Back Matter

    Pages 227-240
    Download chapter PDF
Back to top

Keywords

About this book

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 words, there is feedback. Note that the result of the inspection is that a certain percentage of the parts tested do not conform. That is, there is a positive probability (strictly less than 1) that any part is defective.

Authors and Affiliations

  • Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, Karlsruhe 1, Germany

    Klaus Neumann

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation