Sciweavers

3320 search results - page 156 / 664
» Heuristics for the Phylogeny Problem
Sort
View
EOR
2006
120views more  EOR 2006»
15 years 6 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
ESWA
2010
175views more  ESWA 2010»
15 years 5 months ago
A multi-objective PSO for job-shop scheduling problems
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
D. Y. Sha, Hsing-Hung Lin
BPM
2009
Springer
140views Business» more  BPM 2009»
16 years 1 months ago
Mobile Workforce Scheduling Problem with Multitask-Processes
Abstract. In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes ...
Asvin Goel, Volker Gruhn, Thomas Richter
IPPS
2006
IEEE
16 years 18 days ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
CEC
2005
IEEE
16 years 6 days ago
A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
José E. Gallardo, Carlos Cotta, Antonio J. ...