Seat Assignment Problem Optimization

Authors: Mohammed Salem Alzahrani

Abstract:

In this paper the optimality of the solution of an existing real word assignment problem known as the seat assignment problem using Seat Assignment Method (SAM) is discussed. SAM is the newly driven method from three existing methods, Hungarian Method, Northwest Corner Method and Least Cost Method in a special way that produces the easiness & fairness among all methods that solve the seat assignment problem.

Keywords: Assignment Problem, Hungarian Method, Least Cost Method, Northwest Corner Method, Seat Assignment Method (SAM), A Real Word Assignment Problem.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1077100

References:

[1] A Fast, Near Optimal Heuristic for the Work Station Assignment Problem, Candance Aral Yano.
[2] Applied Management Science: Modeling, Spreadsheet Analysis, and Communication for Decision Making, 2nd Edition, John A. Lawrence,Barry A. Pasternack.
[3] Operations Research: An Introduction (9th Edition), Hamdy A. Taha
[4] Operations Research: Methods, Models, and Applications, Jay E Aronson, Stanley Zionts.
[5] Operations Research Applications and Algorithms 4th Edition, Wayne Winston, 2003.
[6] Managerial Decision Modeling with Spreadsheets (2nd Edition), NagrajBalakrishnan (Author), Barry Render (Author), Ralph M. Stair (Author).
[7] Orlin, James B., 1953- &Lee, Yusin., 1993. "QuickMatch - a very fast algorithm for the assignment problem," Working papers 3547-93., Massachusetts Institute of Technology (MIT), Sloan School of Management.