Sciweavers

197 search results - page 20 / 40
» Optimizing Chemotherapy Scheduling Using Local Search Heuris...
Sort
View
JPDC
2006
85views more  JPDC 2006»
13 years 7 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
ATAL
2007
Springer
14 years 1 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
GECCO
2003
Springer
122views Optimization» more  GECCO 2003»
14 years 18 days ago
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
Gaofeng Huang, Andrew Lim
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 7 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger
COR
2010
119views more  COR 2010»
13 years 7 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh