908 search results - page 57 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
120
click to vote
HICSS
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
162
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
126
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
108
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
130
click to vote
VTC
2010
IEEE
15 years 9 days ago
2010
IEEE
—Providing ubiquitous very high data rate coverage in next generation wireless networks is a formidable goal, requiring cost-effective radio access network (RAN) devices, such as...