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 minimization of total time and all demands met. In the study, the priorities in the assignments are based on the tailors\u27 expertise in doing a particular job