An application of an N X M assignment problem to a tailoring shop
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 minimizat...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1989
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16084 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |