Results 291 to 300 of about 1,129,724 (343)
Some of the next articles are maybe not open access.
Operations Research, 1962
Efficient algorithms are developed optimizing an important class of capacity scheduling models. The specific problem considered can be simply described in terms of contracting for warehousing capacity. Contracts must be let for warehouse capacity over n time periods, with the minimum capacity to be provided in each time period being specified. Savings
Arthur F. Veinott, Harvey M. Wagner
openaire +1 more source
Efficient algorithms are developed optimizing an important class of capacity scheduling models. The specific problem considered can be simply described in terms of contracting for warehousing capacity. Contracts must be let for warehouse capacity over n time periods, with the minimum capacity to be provided in each time period being specified. Savings
Arthur F. Veinott, Harvey M. Wagner
openaire +1 more source
Naval Research Logistics Quarterly, 1968
AbstractWe consider the problem of temporal expansion of the capacity of, say, a plant or road given estimates of its desired usage (demand). The basic problem is: given a sequence of predicted demands for N time periods, determine the optimal investment decision in each period to minimize a linear investment cost and a strictly convex cost of capacity.
Howard, G. T., Nemhauser, G. L.
openaire +1 more source
AbstractWe consider the problem of temporal expansion of the capacity of, say, a plant or road given estimates of its desired usage (demand). The basic problem is: given a sequence of predicted demands for N time periods, determine the optimal investment decision in each period to minimize a linear investment cost and a strictly convex cost of capacity.
Howard, G. T., Nemhauser, G. L.
openaire +1 more source
Optimization of CPM Pragmatic Capacity
IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, 2007The paper extends the pragmatic approach to coded continuous-phase modulation (CPM). It first proposes an optimization of the CPM capacity for given complexity and bandwidth efficiency. Then, the best CPM schemes are embedded into a pragmatic coded-modulation scheme, whose pragmatic capacity (a.k.a. BICNI capacity) is maximized through a careful design
BENEDETTO, Sergio +3 more
openaire +3 more sources
OPTIMIZATION OF SURGE CAPACITY
Chemical Engineering Communications, 1994Abstract Surge tanks within a process are often necessary to smooth out fluctuations in plant operation and process upsets. The only previous research done on tank sizing for flow smoothing was done by Hiester (1985). In this reseach, a program is developed that specifies the size and location of surge capacity required for different control schemes of
E.G. AUFULDISH, S.S. MELSHEIMER
openaire +1 more source
1966
A company which operates a general machine shop is concerned to know whether it has sufficient machine capacity to deal with the orders which it receives. Records of the daily arrival rate of orders during the last year, taken from the company’s Order Book, show that in 240 days the frequency for 1, 2, …, 10 orders arriving in one day was 24. There was
Samuel Eilon +2 more
openaire +1 more source
A company which operates a general machine shop is concerned to know whether it has sufficient machine capacity to deal with the orders which it receives. Records of the daily arrival rate of orders during the last year, taken from the company’s Order Book, show that in 240 days the frequency for 1, 2, …, 10 orders arriving in one day was 24. There was
Samuel Eilon +2 more
openaire +1 more source
Optimal Capacity Expansion with Inventory
Operations Research, 1976In a given region over a finite time horizon, a known nondecreasing demand for a single commodity has to be satisfied by production in that period and/or by inventory from the previous period. There is no initial production capacity or inventory, but the capacity and production may be increased at the beginning of each discrete time period.
openaire +1 more source
Capacity requirements planning—optimal work station capacities
International Journal of Production Research, 1981Abstract The How of work through a work station is analysed in terms of planned input from previous stations, planned output to subsequent stations, planned work-in-process waiting for processing and the planned queue of unprocessed work delayed for processing during sonic subsequent period. The planner is assumed to have some leeway in determining the
openaire +1 more source
Optimal ?-? trees with capacity constraint
Acta Informatica, 1978We consider a specific kind of binary trees with weighted edges. Each right edge has weight ? while each left edge has weight β. Furthermore, no path in the tree is allowed to contain L or more consecutive ?-edges, where L ? 1 is fixed. Given, ?, β, L and the number of nodes n, an optimal tree is one which minimizes the total weighted path length ...
D. M. Choy, C. K. Wong
openaire +1 more source
Disentangling Capacity Control from Price Optimization
SSRN Electronic Journal, 2015Standard revenue management (RM) methods typically work with an integrated forecast of demand and customer choice at booking class level and then maximize revenue by optimally controlling class availability. We show that the structure of the RM problem can be decomposed into two sub-problems: capacity control and price optimization for incoming ...
Jonas Rauch, Karl Isler, Stefan Poelt
openaire +1 more source
Optical transport network capacity optimization
2017 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo), 2017The most efficient transmission system of the transport network is OTN offered by ITU-T G.709. However, in this recommendation, there is no indication as to what degree of MQAM determining the number of points of signal constellation provides the maximum capacity of multichannel system. This work removes this gap.
V. A. Breskin, D. M. Rozenvasser
openaire +1 more source