IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v81y2022i2d10.1007_s10589-021-00340-0.html
   My bibliography  Save this article

An alternate approach to solve two-level priority based assignment problem

Author

Listed:
  • Fanrong Xie

    (Sichuan University of Science and Engineering
    Chinese Academy of Sciences
    Nanchang University)

  • Anuj Sharma

    (Panjab University)

  • Zuoan Li

    (Sichuan University of Science and Engineering)

Abstract

Two-level priority based assignment problem (2PBAP) is an important optimization problem due to the timely delivery requirement in project management. Only four methods with deficiency are available in the literature to solve 2PBAP. In this paper, 2PBAP is reduced to a series of finding the feasible flow in a network with lower and upper arc capacities, and consequently two iterative algorithms are developed to solve 2PBAP. It is proved that both iterative algorithms find the optimal solution to 2PBAP in a strongly polynomial time. Owing to having fully utilized the network flow structural characteristic inherent to 2PBAP, both iterative algorithms have the advantages such as easy implementation on computer, no memory overflow in implementation on computer for large scale instances, high computational efficiency, and easy extension to the priority based assignment problem with priority level more than two, and successfully overcome the deficiency of existing approaches. Computational experiments validate that in terms of computational time, one of our proposed iterative algorithms has higher efficiency than the other, and rivals the existing best approach.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:81:y:2022:i:2:d:10.1007_s10589-021-00340-0
    DOI: 10.1007/s10589-021-00340-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-021-00340-0
    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/s10589-021-00340-0?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. Pinker, Edieal & Szmerekovsky, Joseph & Tilson, Vera, 2014. "On the complexity of project scheduling to minimize exposed time," European Journal of Operational Research, Elsevier, vol. 237(2), pages 448-453.
    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. Seungkyu Ryu & Anthony Chen & Xiangdong Xu & Keechoo Choi, 2014. "A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints," Networks and Spatial Economics, Springer, vol. 14(2), pages 245-270, June.
    5. Sonia & Puri, M.C., 2008. "Two-stage time minimizing assignment problem," Omega, Elsevier, vol. 36(5), pages 730-740, October.
    6. Fanrong Xie & Zuoan Li, 2020. "An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(05), pages 1-33, October.
    7. Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
    8. Sherali, Hanif D., 1982. "Equivalent weights for lexicographic multi-objective programs: Characterizations and computations," European Journal of Operational Research, Elsevier, vol. 11(4), pages 367-379, December.
    9. 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.
    10. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    5. 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.
    6. 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.
    7. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2024. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," CESifo Working Paper Series 11120, CESifo.
    8. 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.
    9. 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.
    10. 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.
    11. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    12. Nisse, Nicolas & Salch, Alexandre & Weber, Valentin, 2023. "Recovery of disrupted airline operations using k-maximum matching in graphs," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1061-1072.
    13. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    14. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    15. Omar Zatarain & Jesse Yoe Rumbo-Morales & Silvia Ramos-Cabral & Gerardo Ortíz-Torres & Felipe d. J. Sorcia-Vázquez & Iván Guillén-Escamilla & Juan Carlos Mixteco-Sánchez, 2023. "A Method for Perception and Assessment of Semantic Textual Similarities in English," Mathematics, MDPI, vol. 11(12), pages 1-20, June.
    16. Wang, Gang, 2024. "Order assignment and two-stage integrated scheduling in fruit and vegetable supply chains," Omega, Elsevier, vol. 124(C).
    17. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    18. Winker, Peter, 2023. "Visualizing Topic Uncertainty in Topic Modelling," VfS Annual Conference 2023 (Regensburg): Growth and the "sociale Frage" 277584, Verein für Socialpolitik / German Economic Association.
    19. Robert M. Curry & Joseph Foraker & Gary Lazzaro & David M. Ruth, 2024. "Practice Summary: Optimal Student Group Reassignment at U.S. Naval Academy," Interfaces, INFORMS, vol. 54(3), pages 205-210, May.
    20. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.

    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:coopap:v:81:y:2022:i:2:d:10.1007_s10589-021-00340-0. 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.