The Discrete-time Sequencing Expansion Problem

Article Abstract:

A sequencing expansion problem in which capacity can be added only at discrete points in line is considered. Given is a forecast of demand in each period, and a set of expansion projects each with a given capacity and cost. The problem is to determine the sequence of expansions necessary to provide sufficient capacity in all periods at minimum cost. The problem is solved using Lagrangean relaxation. Computational results are given in a series of tables.

Business planning, Forecasting, Dynamic programming, Decision theory, Dynamic Systems, Mathematical Programming, Expansion, Capacity Management

---

Complexity of the Project Sequencing Problem

Article Abstract:

The computational complexity of the project sequencing problem is analyzed. The total general decision problem is NP-complete as proven. A special case is solvable in polynomial time. A sequencing problem arising in planning expansion of capacity for a growing market is the project sequencing problem. The problem is especially important in water resources development.

Mathematical models, Models, Systems, Polynomial Time, Water Supply

---

There Are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs

Article Abstract:

The minimization of total delay costs in sequencing a group of independent tasks on a single processor is addressed. There are two known priority rules. One applies when costs are linear. The other applies to a class of exponential functions. It is shown that no other priority rules apply to this class of delay cost functions.

Queuing theory, Scheduling, Scientific Research, Minimization

Similar abstracts:

• Abstracts: An introduction to biodiversity concepts for environmental economists. Policy persistence in environmental regulation
• Abstracts: 3D imaging aids in broiler retrofit. Geothermal research could cut drilling costs. Water pump coating trims BGE repair time
• Abstracts: Waiting for the call. The states' role in next generation of nuclear powerplants
• Abstracts: Decision-Aiding Models: Validation, Assessment, and Related Issues of Policy Analysis. Decreasing Failure Rates and Related Issues in the Social Sciences
• Abstracts: Search for a Moving Target: The FAB Algorithm. An Algorithm for a Class of Discrete Maximum Entropy Problems. (An Absolute Value of E) Time Algorithm for Computing the Reliability of a Class of Directed Networks

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.