Deterministic Multi-Item Inventory Systems with Limited Capacity

Zoller, Klaus

doi:10.1287/mnsc.24.4.451

Cited by 52 publications

(18 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One is the Lagrangian relaxation approach (c.f., Hadley and Whitin (1963), Parsons (1966), Johnson and Montgomery (1974)), where Lagrangian multipliers are used and the global optimization problem is decomposed into single item problems. The other is the equal cycle length approach (c.f., Krone (1964), Parsons (1965), Homer (1966), Page and Paul (1976), Zoller (1977), Goyal (1978)), where all the items share the same cycle, and the decisions are to choose the equal cycle length and the replenishment times for items.…”

Section: Literature Reviewmentioning

confidence: 99%

A class of random algorithms for inventory cycle offsetting

Croot

Huang

2013

IJOR

View full text Add to dashboard Cite

The inventory cycle offsetting problem (ICP) is a strongly NPcomplete problem. We study this problem from the view of probability theory, and rigorously analyze the performance of a specific random algorithm for this problem; furthermore, we present a "local search" algorithm, and a modified local search, which give much better results (the modified local search gives better results than plain local search), and leads to good solutions to certain practical instances of ICP, as we demonstrate with some numerical data. The regime where the random algorithm is rigorously proved to work is when the number of items is large, while the time horizon and unit volumes are not too large. Under such natural hypotheses, the Law of Large Numbers, and various quantitative refinements (such as Bernstein's inequality) 1 come into play, and we use these results to show that there always exist good solutions, not merely that good solutions holds with high probability.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A class of random algorithms for inventory cycle offsetting

Croot

Huang

2013

IJOR

View full text Add to dashboard Cite

show abstract

“…( 8 ) That is, it is required to maximize T subject to the constraints of types (a) and (b) described in Section 3 plus the constraints determined by W . Total inventory will be.…”

Section: Scheduling Two Products On a Single Machine With Changeover mentioning

confidence: 99%

“…However, neither they, nor Zoller in earlier related work [8], considered the situation where both products are produced on the same facility.…”

Section: Introductionmentioning

confidence: 98%

One‐ and two‐stage scheduling of two products with distributed inserted idle time: The benefits of a controllable production rate

Buzacott

Özkarahan

1983

Naval Research Logistics

View full text Add to dashboard Cite

CanadaConsider the problem of scheduling two products on a single machine or through two machines in series when demand is constant and there is a changeover cost between runs of different products on the same machine. As well as setting batch sizes, it is assumed that the production scheduler can choose the production rate for each product, provided an upper bound is not exceeded. This is equivalent to permitting distributed inserted idle time over the production run. It is shown that characteristic of the optimum schedule is that there is no idle time concentrated between runs; it is all distributed over the tun. If the inventory charge is based on average inventory then one product is always produced at maximum rate on the bottleneck stage; however, if there is an inventory constraint based on maximum inventory then in the single-stage case it can occur that neither product is produced at maximum rate.

show abstract

“…Several authors proposed methods to minimize the sum of order and inventory holding costs while trying to stagger replenishment in order to satisfy space availability or other resource constraints. Zoller (1977) and Rosenblatt and Rothblum (1990) considered this problem under the assumption that all items have the same cycle length. Hartley and Thomas (1982) and Thomas and Hartley (1983) considered the two item case.…”

Section: Introductionmentioning

confidence: 99%

Offsetting inventory replenishment cycles to minimize storage space

Boctor

2010

European Journal of Operational Research

View full text Add to dashboard Cite

In a recent paper, Murthy, Benton and Rubin (2003) discussed the problem of offsetting inventory replenishment cycles of several items in order to minimize the maximum required storage space. They analyzed the case where replenishment cycles are given integer multiples of a basic period and proposed a heuristic to solve the problem. While they provided a good analysis of the considered problem, the proposed heuristic produces less interesting results. In the following, a simpler, more efficient and easier to implant heuristic is proposed. Numerical results are provided to prove its superiority.

show abstract

Deterministic Multi-Item Inventory Systems with Limited Capacity

Cited by 52 publications

References 4 publications

A class of random algorithms for inventory cycle offsetting

A class of random algorithms for inventory cycle offsetting

One‐ and two‐stage scheduling of two products with distributed inserted idle time: The benefits of a controllable production rate

Offsetting inventory replenishment cycles to minimize storage space

Contact Info

Product

Resources

About