1719 search results - page 126 / 344 » Scheduling with soft constraints |
CP
2005
Springer
14 years 4 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...
ASPDAC
2007
ACM
14 years 2 months ago
2007
ACM
Abstract--An integrated test scheduling methodology for multiprocessor System-on-Chips (SOC) utilizing the functional buses for test data delivery is described. The proposed method...
COR
2007
13 years 10 months ago
2007
Many approaches have been taken in academic environments to address the problem of student and course timetabling. Typically, student scheduling and course scheduling have been tr...
ASPDAC
2011
ACM
13 years 2 months ago
2011
ACM
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
KBS
2007
13 years 10 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...