Showing 1 - 2 of 2
Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...
Persistent link: https://www.econbiz.de/10005048890
Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...
Persistent link: https://www.econbiz.de/10008564281