The assignment problem applied to DLSU maintenance staff
Date of Publication
1982
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Applied Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This study discusses an application of the assignment model, particularly the Hungarian method of solution to the janitorial job assignment of the DLSU Custodial Office. The assignment problem is a special class of linear programming problem whose objective is to assign a number of entities, e.g., supplies, machines, men, etc., or resources to the same number of activities at maximum efficiency. The study seeks a possible better assignment scheme for the DLSU custodial staff.The topics discussed in this thesis include the assignment problem and its dual, the Hungarian method, variations of the assignment problem and the DLSU janitorial job assignment problem.
Abstract Format
html
Language
English
Format
Accession Number
TU02799
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
64 leaves
Recommended Citation
Cinco, C. H., & Tiangco, A. G. (1982). The assignment problem applied to DLSU maintenance staff. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15114
