The assignment problem applied to DLSU maintenance staff

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., s...

Full description

Saved in:
Bibliographic Details
Main Authors: Cinco, Cristina H., Tiangco, Arnold G.
Format: text
Language:English
Published: Animo Repository 1982
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/15114
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_bachelors-15627
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-156272021-11-21T03:25:56Z The assignment problem applied to DLSU maintenance staff Cinco, Cristina H. Tiangco, Arnold G. 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. 1982-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15114 Bachelor's Theses English Animo Repository
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
description 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.
format text
author Cinco, Cristina H.
Tiangco, Arnold G.
spellingShingle Cinco, Cristina H.
Tiangco, Arnold G.
The assignment problem applied to DLSU maintenance staff
author_facet Cinco, Cristina H.
Tiangco, Arnold G.
author_sort Cinco, Cristina H.
title The assignment problem applied to DLSU maintenance staff
title_short The assignment problem applied to DLSU maintenance staff
title_full The assignment problem applied to DLSU maintenance staff
title_fullStr The assignment problem applied to DLSU maintenance staff
title_full_unstemmed The assignment problem applied to DLSU maintenance staff
title_sort assignment problem applied to dlsu maintenance staff
publisher Animo Repository
publishDate 1982
url https://animorepository.dlsu.edu.ph/etd_bachelors/15114
_version_ 1772834919957921792