Sciweavers

547 search results - page 9 / 110
» Preference-Based Search for Scheduling
Sort
View
AIPS
2004
15 years 8 days ago
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
97
Voted
ATAL
2009
Springer
15 years 5 months ago
Producing timely recommendations from social networks through targeted search
There has been a significant increase in interest and participation in social networking websites recently. For many users, social networks are indispensable tools for sharing pe...
Anil Gürsel, Sandip Sen
90
Voted
EVOW
2012
Springer
13 years 6 months ago
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, ...
CP
1997
Springer
15 years 3 months ago
Five Pitfalls of Empirical Scheduling Research
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...
J. Christopher Beck, Andrew J. Davenport, Mark S. ...
90
Voted
AIPS
2006
15 years 8 days ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith