137 search results - page 3 / 28 » An Improved Integer Local Search for Complex Scheduling Prob... |
AIPS
2008
13 years 7 months ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
AAAI
2000
13 years 6 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
COR
2010
13 years 5 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
HM
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...