A Greedy Randomized Adaptive Search Procedure for the Broadcast Scheduling Problem
نویسندگان
چکیده
In the Broadcast Scheduling Problem (BSP), a finite set of wireless stations are to be scheduled in a time division multiple access frame. The objective is to provide a collision free broadcast schedule which minimizes the total frame length and maximizes the slot utilization within the frame. We present a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. GRASP is a two-phase metaheuristic for combinatorial optimization. In the first phase, a greedy randomized initial feasible solution is created. The initial solution is then improved by the application of a local search procedure. Numerical examples are given and results of the GRASP are compared with those of other scheduling algorithms.
منابع مشابه
Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملFitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملFacility-wide Planning and Scheduling of Printed a Grasp for Single Machine Scheduling with Sequence Dependent Setup Costs and Linear Delay Penalties, Tech. Report, Operations Procedure Grasp()
A greedy randomized adaptive search procedure for the quadratic assignment problem, A new method for solving hard Sat-A greedy randomized adaptive search procedure for the 2-partition problem,
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کامل