874 search results - page 37 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
AAAI
2004
14 years 11 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
100
click to vote
CP
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
IJCAI
1989
14 years 11 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
HM
2007
Springer
15 years 4 months ago
2007
Springer
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper is focused on the coordination of order and production policy between buyers and suppliers in supply chains. When a buyer and a supplier of an item work independently, ...