The second part of the expository paper started with Elmaghraby, S. E. 1970. The theory of networks and management science. Part I. Management Sci. 17(1, September) 1-34.

In PERT-type networks, where activity times are random variables, the expected duration of the total project can be approximated by first substituting the expected values of the individual activities, and then evaluating the length of the critical path. This paper develops two improved...

An expository treatment of three network models most often encountered in Management Science applications: (i) The Shortest Path Problems, (ii) Flow Networks, and (iii) Activity Networks. In the first problem are discussed the shortest path between two specified nodes; the shortest distance...

This paper describes a production smoothing system which combines several known scheduling tools into an operational unit. The input to the system is forecasted customer demand; the outputs are the required production levels, size of labor force, planned overtime and expected inventories of...

In a recent paper [Moore, J. M. 1968. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15(1, September).] Moore addressed himself to the problem of the title, and devised a rather simple algorithm for its solution. He also mentions a somewhat...

A stochastic PERT network is a directed acyclic network in which the arc lengths are independent random variables with known distributions. A fundamental problem in PERT networks is to identify the activities which are critical to the achievement of the project objectives. In an activity network...

Because of the stochastic nature of the parameters in the general job shop problem (e.g., estimates of processing times; estimates of delay times; the sequence of operations; the availability of processing units; etc.), Monte Carlo simulation has been the principal tool of analysis. In...

This paper generalizes the approach of activity networks, exemplified by PERT and CPM, to networks in which activites and events occur probabilistically and contain logical relationships of a more complicated nature. For example, from a specific event some activities are undertaken with...

The problem of allocation under uncertain demand, when the latter has a continuous distribution function, is treated. A necessary and sufficient condition for optimality is given, and a numerical example is solved. This solution is compared with the L.P. solutions obtained under the assumptions...

The ELSP is a time-honored problem that "has been around" since 1915. It is the problem of accommodating cyclical production patterns when several products are made on a single facility. Recent contributions to its resolution resulted in either analytical approaches to a restricted problem, or...