Note on Assignment Algorithm with Easy Method of Drawing Lines to Cover All Zeros

The Assignment algorithm is around 54 years old and a lot of work has been done on this algorithm. In this study various aspect of assignment algorithm has been considered. The endeavor of this note is to make solution of assignment problem so simple that even class tenth student can easily solve it. One of the most important aspects of assignment algorithm (Hungarian Algorithm) is to draw lines to cover all the zeros, in this study a new and easy method has been proposed to cover all the zeros, which helps to make this algorithm easy.

[1]  Bryan Christiansen,et al.  Cultural Variations and Business Performance: Contemporary Globalism , 2012 .

[2]  Fawwaz Elkarmi,et al.  Electricity Demand Forecasting: An Essential Tool for Power System Planning, Operation and Control , 2014 .

[3]  Fred W. Glover,et al.  An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..

[4]  Ewan S. Page.  A Note on Assignment Problems , 1963, Comput. J..

[5]  Jay Sethuraman,et al.  A solution to the random assignment problem on the full preference domain , 2006, J. Econ. Theory.

[6]  Shahin Gelareh,et al.  On Truck dock assignment problem with operational time constraint within cross docks , 2013 .

[7]  Takeo Yamada,et al.  A reduction approach to the repeated assignment problem , 2011, Eur. J. Oper. Res..

[8]  T. A. Porsching.  Matrix Assignments and an Associated Min Max Problem , 1963 .

[9]  Michel Minoux,et al.  Modeling and solving a Crew Assignment Problem in air transportation , 2006, Eur. J. Oper. Res..

[10]  Nair Maria Maia de Abreu,et al.  A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[11]  Rakesh V. Vohra,et al.  An on-line assignment problem with random effectiveness and costly information , 1987 .

[12]  Ronald D. Armstrong,et al.  Solving linear bottleneck assignment problems via strong spanning trees , 1992, Oper. Res. Lett..

[13]  Andrew Lim,et al.  Truck dock assignment problem with operational time constraint within crossdocks , 2006, Eur. J. Oper. Res..

[14]  E. Turkina.  Cross-Border Inter-Firm Networks in Contemporary Europe: The Effects of Structural and Cultural Embeddedness on Firm Performance , 2012 .

[15]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..

[16]  Petter Gottschalk,et al.  Knowledge Driven Service Innovation and Management: IT Strategies for Business Alignment and Value Creation , 2012 .

[17]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[18]  George L. Nemhauser,et al.  Some properties of the fleet assignment problem , 1994, Oper. Res. Lett..

[19]  Giovanni Righini,et al.  A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem , 2006, Oper. Res..

[20]  Ibrahim H. Osman,et al.  A Cognitive Analytics Management Framework (CAM-Part 1): SAMAS Components, Leadership, Frontier Performance Growth, and Sustainable Shared Value , 2014 .

[21]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[22]  George Yannis,et al.  Analysis of Pedestrian Road Crossing Behaviour in Urban Areas , 2014, Int. J. Oper. Res. Inf. Syst..

[23]  Ali Emrouznejad,et al.  Handbook of Research on Strategic Performance Management and Measurement Using Data Envelopment Analysis , 2013 .

[24]  Aubrey B. Poore,et al.  Some assignment problems arising from multiple target tracking , 2006, Math. Comput. Model..

[25]  Bhuvan Unhelkar,et al.  Collaborative Business Process Engineering and Global Organizations: Frameworks for Service Integration , 2009 .

[26]  Abraham P. Punnen.  On bottleneck assignment problems under categorization , 2004, Comput. Oper. Res..

[27]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[28]  Vahid Lotfi.  A labeling algorithm to solve the assignment problem , 1989, Comput. Oper. Res..

[29]  H. W. Kuhn,et al.  Variants of the hungarian method for assignment problems , 1956 .

[30]  A. Volgenant,et al.  A note on the assignment problem with seniority and job priority constraints , 2004, Eur. J. Oper. Res..

[31]  Robert M. Nauss,et al.  Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach , 2003, INFORMS J. Comput..