IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2270.html
   My bibliography  Save this paper

Deterministic approximations to co-production problems with service constraints

Author

Listed:
  • Bitran, Gabriel R.
  • Leong, Thin-Yin.

Abstract

Includes bibliographical references (p. 31-32).

Suggested Citation

  • Bitran, Gabriel R. & Leong, Thin-Yin., 1989. "Deterministic approximations to co-production problems with service constraints," Working papers 3071-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2270
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2270
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. F. M. Allen & R. N. Braswell & P. V. Rao, 1974. "Distribution-Free Approximations for Chance Constraints," Operations Research, INFORMS, vol. 22(3), pages 610-621, June.
    2. Fredrick S. Hillier, 1967. "Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables," Management Science, INFORMS, vol. 14(1), pages 34-57, September.
    3. Gabriel R. Bitran & Horacio H. Yanasse, 1984. "Deterministic Approximations to Stochastic Production Problems," Operations Research, INFORMS, vol. 32(5), pages 999-1018, October.
    4. Uday S. Karmarkar, 1987. "The Multilocation Multiperiod Inventory Problem: Bounds and Approximations," Management Science, INFORMS, vol. 33(1), pages 86-94, January.
    5. Yrjö Seppälä, 1971. "Constructing Sets of Uniformly Tighter Linear Approximations for a Chance Constraint," Management Science, INFORMS, vol. 17(11), pages 736-749, July.
    6. Bryan L. Deuermeyer & William P. Pierskalla, 1978. "A By-Product Production System with an Alternative," Management Science, INFORMS, vol. 24(13), pages 1373-1383, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bitran, Gabriel R. & Leong, Thin-Yin., 1989. "Hotel sales and reservations planning," Working papers 3108-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Bitran, Gabriel R. & Leong, Thin-Yin., 1989. "Co-production of substitutable products," Working papers 3097-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zare M., Yahia & Daneshmand, Ahmad, 1995. "A linear approximation method for solving a special class of the chance constrained programming problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 213-225, January.
    2. Bitran, Gabriel R. & Leong, Thin-Yin., 1990. "Distribution-free, uniformly-tighter linear approximations for chance-constrained programming," Working papers 3111-90., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Poojari, Chandra A. & Varghese, Boby, 2008. "Genetic Algorithm based technique for solving Chance Constrained Problems," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1128-1154, March.
    4. Bitran, Gabriel R. & Leong, Thin-Yin., 1989. "Co-production of substitutable products," Working papers 3097-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. Nils Rudi & Sandeep Kapur & David F. Pyke, 2001. "A Two-Location Inventory Model with Transshipment and Local Decision Making," Management Science, INFORMS, vol. 47(12), pages 1668-1680, December.
    6. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    7. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    8. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    9. Tempelmeier, Horst, 2007. "On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 181(1), pages 184-194, August.
    10. Hongmin Li & Stephen C. Graves & Woonghee Tim Huh, 2014. "Optimal Capacity Conversion for Product Transitions Under High Service Requirements," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 46-60, February.
    11. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
    12. Xinxin Hu & Izak Duenyas & Roman Kapuscinski, 2008. "Optimal Joint Inventory and Transshipment Control Under Uncertain Capacity," Operations Research, INFORMS, vol. 56(4), pages 881-897, August.
    13. Elena Katok & William Tarantino & Terry P. Harrison, 2003. "Investment in production resource flexibility: An empirical investigation of methods for planning under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(2), pages 105-129, March.
    14. Yale T. Herer & Michal Tzur, 2001. "The dynamic transshipment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 386-408, August.
    15. Kumar Rajaram & Uday S. Karmarkar, 2002. "Product Cycling With Uncertain Yields: Analysis and Application to the Process Industry," Operations Research, INFORMS, vol. 50(4), pages 680-691, August.
    16. Sumit Kunnumkal & Huseyin Topaloglu, 2008. "A duality‐based relaxation and decomposition approach for inventory distribution systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 612-631, October.
    17. Zhang, Jiaqi & Archibald, Thomas W., 2011. "A semi-Markov model with holdout transshipment policy and phase-type exponential lead time," European Journal of Operational Research, Elsevier, vol. 211(3), pages 650-657, June.
    18. Tiacci, Lorenzo & Saetta, Stefano, 2011. "Reducing the mean supply delay of spare parts using lateral transshipments policies," International Journal of Production Economics, Elsevier, vol. 133(1), pages 182-191, September.
    19. Miguel A. Lejeune & Andrzej Ruszczyński, 2007. "An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems," Operations Research, INFORMS, vol. 55(2), pages 378-394, April.
    20. Huseyin Topaloglu & Sumit Kunnumkal, 2006. "Approximate dynamic programming methods for an inventory allocation problem under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 822-841, December.

    More about this item

    Keywords

    HD28 .M414 no.3071-; 89;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2270. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.