An application of an N X M assignment problem to a tailoring shop
Date of Publication
1989
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Applied Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
The study involves solving the problem of a tailoring shop which has n n number of tailors with m number of jobs by utilizing the Assignment Model with the Hungarian Algorithm. It proposes a new system that could assign the tailors to specific groups that would do a particular job with the minimization of total time and all demands met. In the study, the priorities in the assignments are based on the tailors' expertise in doing a particular job.
Abstract Format
html
Language
English
Format
Accession Number
TU06094
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
49 numb. leaves
Keywords
Problem solving; Tailoring; Algorithm; Shop mathematics
Recommended Citation
Beltran, K., & Chuakay, G. (1989). An application of an N X M assignment problem to a tailoring shop. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16084
