2354 search results - page 142 / 471 » Assignment Problems |
132
Voted
EUROMICRO
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
93
Voted
AIPS
2006
15 years 3 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
139
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
166
Voted
CP
2005
Springer
15 years 8 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...
137
Voted
CONSTRAINTS
2006
15 years 2 months ago
2006
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...