Sciweavers

3433 search results - page 69 / 687
» Heuristics for a bidding problem
Sort
View
HEURISTICS
2006
109views more  HEURISTICS 2006»
13 years 7 months ago
A scatter search algorithm for project scheduling under partially renewable resources
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be view...
Ramón Alvarez-Valdés, Enric Crespo, ...
EVOW
2009
Springer
14 years 2 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang
AIPS
2006
13 years 9 months ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 1 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
IPPS
1999
IEEE
14 years 22 hour ago
A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...
Dalessandro Soares Vianna, Luiz Satoru Ochi, L&uac...