A New Model for Reassignment of Tasks to Available Employees in Iraq’s Firms
Generalized assignment problem (GAP) is a well-known problem in the combinatorial optimization. This problem is a specific form of assignment problem (AP) when the employees can carry out more than one task simultaneously or each work can be assigned to more than one employee. In this paper, a new m...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2020-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2020/2673793 |
| Summary: | Generalized assignment problem (GAP) is a well-known problem in the combinatorial optimization. This problem is a specific form of assignment problem (AP) when the employees can carry out more than one task simultaneously or each work can be assigned to more than one employee. In this paper, a new model is proposed for reassigning tasks on the available employees of Iraq companies when at least one of the jobholders is absent. Likewise, the returning workers from long holidays assumption are incorporated. Finally, a heuristic algorithm for solving reassignment tasks on laborers is introduced. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |