39 search results - page 3 / 8 » Approximation algorithms for scheduling problems with a modi... |
IOR
2007
13 years 6 months ago
2007
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...
CPAIOR
2004
Springer
13 years 11 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
AAAI
1998
13 years 7 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
AEI
2000
13 years 6 months ago
2000
This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loadin...