547 search results - page 39 / 110 » Preference-Based Search for Scheduling |
118
click to vote
AIPS
2008
15 years 1 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
AICOM
2007
14 years 11 months ago
2007
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
IEAAIE
2001
Springer
15 years 3 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
AAAI
2004
15 years 15 days ago
2004
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...