908 search results - page 77 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
166
Voted
ISPD
1997
ACM
15 years 7 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
139
Voted
PC
2008
15 years 3 months ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
111
click to vote
ESWA
2006
15 years 3 months ago
2006
The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection problems are, however, one of the most difficult ope...
147
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
112
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...