IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i1d10.1007_s12597-019-00399-8.html
   My bibliography  Save this article

A priority based unbalanced time minimization assignment problem

Author

Listed:
  • Ekta Jain

    (Panjab University)

  • Kalpana Dahiya

    (Panjab University)

  • Vanita Verma

    (Panjab University)

Abstract

This paper discusses a priority based unbalanced time minimization assignment problem which deals with the allocation of n jobs to $$m~(

Suggested Citation

  • Ekta Jain & Kalpana Dahiya & Vanita Verma, 2020. "A priority based unbalanced time minimization assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 13-45, March.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:1:d:10.1007_s12597-019-00399-8
    DOI: 10.1007/s12597-019-00399-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00399-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-019-00399-8?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Aggarwal, V., 1983. "The assignment problem under categorized jobs," European Journal of Operational Research, Elsevier, vol. 14(2), pages 193-195, October.
    2. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    3. Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
    4. H. W. Kuhn, 1956. "Variants of the hungarian method for assignment problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(4), pages 253-258, December.
    5. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    6. Sonia & Puri, M.C., 2008. "Two-stage time minimizing assignment problem," Omega, Elsevier, vol. 36(5), pages 730-740, October.
    7. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    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. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    2. Safae Rbihou & Khalid Haddouch & Karim El moutaouakil, 2024. "Optimizing hyperparameters in Hopfield neural networks using evolutionary search," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1245-1273, September.

    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. Ekta Jain & Kalpana Dahiya & Anuj Sharma & Vanita Verma, 2019. "An improved algorithm for two stage time minimization assignment problem," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 713-736, February.
    2. 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.
    3. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    4. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    5. Diefenbach, Heiko & Grosse, Eric H. & Glock, Christoph H., 2024. "Human-and-cost-centric storage assignment optimization in picker-to-parts warehouses," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1049-1068.
    6. Xiaojuan Ning & Yule Liu & Yishu Ma & Zhiwei Lu & Haiyan Jin & Zhenghao Shi & Yinghui Wang, 2024. "TSPconv-Net: Transformer and Sparse Convolution for 3D Instance Segmentation in Point Clouds," Mathematics, MDPI, vol. 12(18), pages 1-15, September.
    7. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    8. Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
    9. Amnon Rosenmann, 2022. "Computing the sequence of k-cardinality assignments," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1265-1283, September.
    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. Liles, Joseph M. & Robbins, Matthew J. & Lunday, Brian J., 2023. "Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1435-1449.
    12. Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    13. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2025. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," Management Science, INFORMS, vol. 71(3), pages 2508-2526, March.
    14. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    15. Weihua Yang & Xu Zhang & Xia Wang, 2024. "The Wasserstein Metric between a Discrete Probability Measure and a Continuous One," Mathematics, MDPI, vol. 12(15), pages 1-13, July.
    16. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    17. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    18. Wu, Xin (Bruce) & Lu, Jiawei & Wu, Shengnan & Zhou, Xuesong (Simon), 2021. "Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 140-179.
    19. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    20. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.

    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:spr:opsear:v:57:y:2020:i:1:d:10.1007_s12597-019-00399-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.