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: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1989
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16084 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |