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...

We consider the problem of the optimal ordering schedule to satisfy a given demand pattern over a finite planning horizon when ordering must be in batches of size Q 1, with and without "setup" cost. A dynamic programming model is constructed. The number of stages are minimized through the...

We present a model for activity networks under generalized precedence relations (GPRs), discuss its temporal analysis and the issues that may arise relative to inconsistency among the specified relations and the activity durations. We also give more precise definition to the concept of...

Author's rejoinder to comments [Yen, J. Y. 1971. On elmaghraby's "the theory of networks and management science." Management Sci. 18(1, September) 84-86.] about his paper.

In this paper, both the duration and the cost of an activity are modeled as random variables, and accordingly, the cumulative cost at each time point also becomes a random variable along a project’s progress. We first present the new concept of an “alphorn of uncertainty” (AoU) to describe...

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...