Results 1 
4 of
4
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 647 (82 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the result. In this chapter, we first describe the basic components of GRASP. Successful implementation techniques and parameter tuning strategies are discussed and illustrated by numerical results obtained for different applications. Enhanced or alternative solution construction mechanisms and techniques to speed up the search are also described: Reactive GRASP, cost perturbations, bias functions, memory and learning, local search on partially constructed solutions, hashing, and filtering. We also discuss in detail implementation strategies of memorybased intensification and postoptimization techniques using pathrelinking. Hybridizations with other metaheuristics, parallelization strategies, and applications are also reviewed.
A greedy randomized adaptive search procedure for job shop scheduling
 IEEE Trans. on Power Systems
, 2001
"... Abstract. In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
Abstract. In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A schedule is an assignment of operations to time slots on the machines. The objective of the JSP is to find a schedule that minimizes the maximum completion time, or makespan, of the jobs. In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for the JSP. A GRASP is a metaheuristic for combinatorial optimization. Although GRASP is a general procedure, its basic concepts are customized for the problem being solved. We describe in detail our implementation of GRASP for job shop scheduling. Further, we incorporate to the conventional GRASP two new concepts: an intensification strategy and POP (Proximate Optimality Principle) in the construction phase. These two concepts were first proposed by Fleurent & Glover (1999) in the context of the quadratic assignment problem. Computational experience on a large set of standard test problems indicates that GRASP is a competitive algorithm for finding approximate solutions of the job shop scheduling problem. 1.
Constraint Programmin and GRASP Approaches to Schedule Oil Well Drillings
"... \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \T ..."
Abstract
 Add to MetaCart
(Show Context)
\Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta \Lambda \Theta \Gamma \Delta
GRASP Strategies for Scheduling Activities at Oil Wells with Resource Displacement
"... Before promising locations at petroliferous basins become productive oil wells, it is often necessary to complete drilling activities at these locations. The scheduling of such activities must satisfy several conflicting constraints and attain a number of goals. Moreover, resource displacements betw ..."
Abstract
 Add to MetaCart
(Show Context)
Before promising locations at petroliferous basins become productive oil wells, it is often necessary to complete drilling activities at these locations. The scheduling of such activities must satisfy several conflicting constraints and attain a number of goals. Moreover, resource displacements between wells are also important. We describe a Greedy Randomized Adaptive Search Procedure (GRASP) for the scheduling of oil well development activities with resource displacement. The results are compared with schedules produced by a well accepted constraint programming implementation. Computational experience on real instances indicates that the GRASP implementation is