Random Yield and Random Demand in a Production System with Downward Substitution

Published Online:https://doi.org/10.1287/opre.47.2.277

References

  • Adler I., Hoffman A. J., Shamir R. Monge and feasibility sequences in general flow problems. (1990) . Rutcor Research report 70-90, Rutgers University, New Brunswick, NJGoogle Scholar
  • Bassok Y., Anupindi R., Akella R. Multiproduct inventory models with substitution. (1993) . Working paper, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
  • Bitran G. R., Dasu S. Ordering policies in an environment of stochastic yields and substitutable demands. Oper. Res. (1992) 40:999–1017LinkGoogle Scholar
  • Bitran G. R., Leong T. Y. Deterministic approximations to coproduction problems with service constraints and random yields. Management Sci. (1992) 38:724–742LinkGoogle Scholar
  • Chvátal V.Linear Programming (1983) (W. H. Freeman and Company, New York) Google Scholar
  • Czyzyk J., Fourer R., Mehrotra S. A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods. ORSA J. Comput. (1995) 7:474–490LinkGoogle Scholar
  • Dantzig G. B., Glynn P. W. Parallel processors for planning of uncertainty. Ann. Oper. Res. (1990) 22:1–21CrossrefGoogle Scholar
  • Dietrich B. L. Monge sequences, antimatroids and transportation problems with forbidden arcs. Linear Algebra and its Applications (1990) 139:133–145CrossrefGoogle Scholar
  • Ermoliev Y., Wets R. J. B.Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Gerchak Y., Tripathy A., Wang K. Co-production models with random functionality yields. IIE Trans. (1996) 28:391–403CrossrefGoogle Scholar
  • Henig M., Gerchak Y. The structure of periodic review policies in the presence of random yield. Oper. Res. (1990) 38:634–643LinkGoogle Scholar
  • Hoffman A. J., Klee V. On simple linear programming problems. Convexity: Proc. Symposia Pure Math. (1963) (American Mathematical Society, Providence, RI) CrossrefGoogle Scholar
  • Hoffman A. J., Anderson I. On greedy algorithms that succeed. Surveys in Combinatorics (1985) (Cambridge University Press)97–112CrossrefGoogle Scholar
  • Karmarkar U., Lin S. C. Production planning with uncertain yields and demands. (1987) . Working paper, Simon Graduate School of Business Administration, University of Rochester, Rochester, NYGoogle Scholar
  • Leachman C. R. Preliminary design and development of a corporate-level production planning system for the semiconductor industry. (1987) . Working paper ORC 86-11, Operations Research Center, University of California at Berkeley, Berkeley, CAGoogle Scholar
  • Lee H. L., Yano C. A. Production control in multistage systems with variable yield losses. Oper. Res. (1988) 36:269–278LinkGoogle Scholar
  • Moinzadeh K., Lee H. L. A continuous-review inventory model with constant resupply time and defective items. Naval Res. Logist. (1987) 34:457–467CrossrefGoogle Scholar
  • Pasternack B., Drezner Z. Optimal inventory policies for substitutable commodities with stochastic demand. Naval Res. Logist. (1991) 38:221–240CrossrefGoogle Scholar
  • Qi L. Forest iteration method for stochastic transportation problem. Math. Programming Stud. (1985) 25:142–163CrossrefGoogle Scholar
  • Robinson L. W. Optimal and approximate policies in multiperiod, multilocation inventory models with transshipment. Oper. Res. (1990) 38:278–295LinkGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Shamir R., Dietrich B. L. Characterization and algorithms for greedily solvable transportation problems. Proc. First ACM/SIAM Sympos. Discrete Algorithms (1990) Philadelphia, PA:358–366Google Scholar
  • Wallace S. W. Decomposing the requirement space of a transportation problem into polyhedral cones. Math. Programming Stud. (1986) 28:29–47CrossrefGoogle Scholar
  • Yano C. A., Lee H. L. Lot sizing with random yields: A review. Oper. Res. (1995) 43:311–334LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.