Skip to main content
SpringerLink
Log in

A note of reduced dimension optimization algorithm of assignment problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Analysing the characters of the elements of the efficiency matrix of the assignment problem, we find some properties of the optimal solution. Different from the traditional algorithm, Hungarian method, we give several principles to recognize some optimal points rapidly, thus we can reduce the dimension of the assignment problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Cardoen B, Demeulemeester E, Beliën J (2010) Operating room planning and scheduling: a literature review. Eur J Oper Res 201:921–932

    Article  MATH  Google Scholar 

  • Fan Z, Liu Y, Yuan Y, Zhu S (2012) Study on the grouping method for rescue workers in the emergency rescu. Oper Res Manag Sci 21:1–7

    Google Scholar 

  • Liu X, Xu F (2014) Discussion on the optimizing method of the hospital department layout based on lingo. Chin Med Equip 29:112–114

    Google Scholar 

  • McDermid EJ, Manlove DF (2010) Keeping partners together: algorithmic results for the hospitals/residents problem with couples. J Comb Optim 19:279–303

    Article  MATH  MathSciNet  Google Scholar 

  • Moccia L, Cordeau JF, Monaco MF, Sammarra M (2009) A column generation heuristic for a dynamic generalized assignment problem. Comput Oper Res 36:2670–2681

    Article  MATH  Google Scholar 

  • Romeijn H, Morales DR (2000) A class of greedy algorithms for the generalized assignment problem. Discret Appl Math 103:209–235

    Article  MATH  MathSciNet  Google Scholar 

  • Sharkeya TC, Romeijnb HE (2010) Greedy approaches for a class of nonlinear generalized assignment problems. Discret Appl Math 158:559–572

    Article  Google Scholar 

  • Woodcock AJ, Wilson JM (2010) A hybrid tabu search/branch & bound approach to solving the generalized assignment problem. Eur J Oper Res 207:566–578

    Article  MATH  MathSciNet  Google Scholar 

  • Yagiura M, Ibaraki T, Glover F (2006) A path relinking approach with ejection chains for the generalized assignment problem. Eur J Oper Res 169:548–569

    Article  MATH  MathSciNet  Google Scholar 

  • Ye X, Pan Q, Kang W, Zhang H (2004) A reduced dimension optimization algorithm of assignment problem. Fire Control Command Control 29:17–20

    Google Scholar 

  • Zhang W, Zhang H (2013) Task assignment optimization for the batch casualty surgeries in emergencies based on extended genetic algorithm. Int J Inf Manag Sci 24:117–127

    Google Scholar 

  • Zhong L, Luo S, Wu L, Xu L, Yang J, Tang G (2014) A two-stage approach for surgery scheduling. J Comb Optim 27:545–556

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

The project was financially supported by Scientific Research Fund of Liaoning Provincial Education Department, No. L2014433. The authors also thank the anonymous reviewers for their valuable comments.

Author information

Authors and Affiliations

  1. Shenyang Normal University, Shenyang, 110035, Liaoning, China

    Mengzhuo Bai

  2. Shenyang the Fourth Hospital of People, Shenyang, 110031, Liaoning, China

    Chunyang Ren

  3. Chaoyang Branch of China Construction Bank, Chaoyang, 122000, Liaoning, China

    Yang Liu

Authors
  1. Mengzhuo Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunyang Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bai, M., Ren, C. & Liu, Y. A note of reduced dimension optimization algorithm of assignment problem. J Comb Optim 30, 841–849 (2015). https://doi.org/10.1007/s10878-015-9851-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9851-4

Keywords

Search

Navigation