Sciweavers

3433 search results - page 169 / 687
» Heuristics for a bidding problem
Sort
View
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 5 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. ...
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
16 years 2 days ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya