Sciweavers

146 search results - page 17 / 30
» A hybrid constraint programming approach to the log-truck sc...
Sort
View
IOR
2007
106views more  IOR 2007»
14 years 9 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
SAC
2004
ACM
15 years 2 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
ATAL
2006
Springer
15 years 1 months ago
A constraint optimization framework for fractured robot teams
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
Mary Koes, Katia P. Sycara, Illah R. Nourbakhsh
63
Voted
ENDM
2006
69views more  ENDM 2006»
14 years 9 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...