21 search results - page 2 / 5 » Non-approximability Results for Scheduling Problems with Min... |
CP
1997
Springer
13 years 9 months ago
1997
Springer
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
NETWORKS
1998
13 years 4 months ago
1998
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
AAAI
1994
13 years 6 months ago
1994
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
EAAI
2007
13 years 4 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de�...
EOR
2006
13 years 4 months ago
2006
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain ...