IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v39y1992i3p389-397.html
   My bibliography  Save this article

On the solution of a stochastic bottleneck assignment problem and its variations

Author

Listed:
  • Prabuddha De
  • Jay B. Ghosh
  • Charles E. Wells

Abstract

In this article, we study the stochastic version of the so‐called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered.

Suggested Citation

  • Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1992. "On the solution of a stochastic bottleneck assignment problem and its variations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 389-397, April.
    • Handle: RePEc:wly:navres:v:39:y:1992:i:3:p:389-397
    DOI: 10.1002/1520-6750(199204)39:33.0.CO;2-6
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199204)39:33.0.CO;2-6
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199204)39:33.0.CO;2-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. R. S. Garfinkel & M. R. Rao, 1971. "The bottleneck transportation problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(4), pages 465-472, December.
    2. Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
    3. Joseph B. Mazzola & Alan W. Neebe, 1986. "Resource-Constrained Assignment Scheduling," Operations Research, INFORMS, vol. 34(4), pages 560-572, August.
    4. Wlodzimierz Szwarc, 1971. "Some remarks on the time transportation problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(4), pages 473-485, December.
    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. Ching-Chung Kuo, 2011. "Optimal assignment of resources to strengthen the weakest link in an uncertain environment," Annals of Operations Research, Springer, vol. 186(1), pages 159-173, June.

    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. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    2. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    3. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    4. I. Stancu-Minasian & R. Caballero & E. Cerdá & M. Muñoz, 1999. "The stochastic bottleneck linear programming problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 123-143, June.
    5. Lieshout, P.M.D. & Volgenant, A., 2007. "A branch-and-bound algorithm for the singly constrained assignment problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 151-164, January.
    6. Barbara M. Anthony & Christine Chung, 2016. "Serve or skip: the power of rejection in online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1232-1253, November.
    7. Punnen, Abraham P. & Aneja, Y. P., 1995. "Minmax combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 81(3), pages 634-643, March.
    8. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    9. Fanrong Xie & Zuoan Li, 2022. "An iterative solution technique for capacitated two-stage time minimization transportation problem," 4OR, Springer, vol. 20(4), pages 637-684, December.
    10. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.
    11. Gaétan Caron & Pierri Hansen & Brigitte Jaumard, 1999. "The Assignment Problem with Seniority and Job Priority Constraints," Operations Research, INFORMS, vol. 47(3), pages 449-453, June.
    12. Niclas Boehmer & Robert Bredereck & Piotr Faliszewski & Andrzej Kaczmarczyk & Rolf Niedermeier, 2020. "Line-Up Elections: Parallel Voting with Shared Candidate Pool," Papers 2007.04960, arXiv.org.
    13. Hesham K. Alfares, 2022. "Plant shutdown maintenance workforce team assignment and job scheduling," Journal of Scheduling, Springer, vol. 25(3), pages 321-338, June.
    14. Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
    15. K. Mathur & M. Puri & S. Bansal, 1995. "On ranking of feasible solutions of a bottleneck linear programming problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 3(2), pages 265-283, December.
    16. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    17. Singh, Gurwinder & Singh, Amarinder, 2023. "Extension of Particle Swarm Optimization algorithm for solving two-level time minimization transportation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 727-742.
    18. Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü, 2021. "The Rank-One Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 979-996, July.
    19. Prabhjot Kaur & Anuj Sharma & Vanita Verma & Kalpana Dahiya, 2022. "An alternate approach to solve two-level hierarchical time minimization transportation problem," 4OR, Springer, vol. 20(1), pages 23-61, March.
    20. Abraham P. Punnen & Ruonan Zhang, 2011. "Quadratic bottleneck problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 153-164, March.

    More about this item

    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:wly:navres:v:39:y:1992:i:3:p:389-397. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.