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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16597 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-165972022-01-27T01:38:18Z An application of an N X M assignment problem to a tailoring shop Beltran, Karen Chuakay, Gina Marie 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. 1989-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16084 Bachelor's Theses English Animo Repository Problem solving Tailoring Algorithm Shop mathematics |
| 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 |
| topic |
Problem solving Tailoring Algorithm Shop mathematics |
| spellingShingle |
Problem solving Tailoring Algorithm Shop mathematics Beltran, Karen Chuakay, Gina Marie An application of an N X M assignment problem to a tailoring shop |
| description |
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. |
| format |
text |
| author |
Beltran, Karen Chuakay, Gina Marie |
| author_facet |
Beltran, Karen Chuakay, Gina Marie |
| author_sort |
Beltran, Karen |
| title |
An application of an N X M assignment problem to a tailoring shop |
| title_short |
An application of an N X M assignment problem to a tailoring shop |
| title_full |
An application of an N X M assignment problem to a tailoring shop |
| title_fullStr |
An application of an N X M assignment problem to a tailoring shop |
| title_full_unstemmed |
An application of an N X M assignment problem to a tailoring shop |
| title_sort |
application of an n x m assignment problem to a tailoring shop |
| publisher |
Animo Repository |
| publishDate |
1989 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16084 |
| _version_ |
1772834903472209920 |