• sonia shivhare

The generalized assignment problem (GAP) is a notable NP-Complete combinatorial improvement issue. And its relegating an arrangement of tasks to an arrangement of operators with least expense. In this paper we endeavor to apply a genetic calculation to enhance a current arrangement of Broadcast Scheduling issue. The summed up task issue is an outstanding NP-Complete combinatorial advancement issue and its allocating a set of jobs to a set of representatives with minimum cost. An attempt has been applied to genetic process to expand the present result of Broadcast Scheduling problem. In this approach the solution in based on the genetic algorithm.

GAP; NP-Complete; Broadcast Scheduling

"A GENETIC ALGORITHM FOR RESOLVE AN EXISTING SOLUTION OF BROADCAST SCHEDULING ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.651-653, March-2019, Available :http://www.jetir.org/papers/JETIR1903894.pdf

"A GENETIC ALGORITHM FOR RESOLVE AN EXISTING SOLUTION OF BROADCAST SCHEDULING ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp651-653, March-2019, Available at : http://www.jetir.org/papers/JETIR1903894.pdf