Problems that do not have complete solutions occur in many areas of application of constraint solving. Heuristic repair methods that have been used successfully on complete CSPs can also be used on over-constrained problems. A diiculty in analyzing their performance is the uncertainty about the goodness of solutions returned in relation to the optimal (best possible) solutions. This diiculty ca...

In this paper we survey computational models for Grid scheduling problems and their resolution using heuristic and meta-heuristic approaches. Scheduling problems are at the heart of any Grid-like computational system. Different types of scheduling based on different criteria, such as static versus dynamic environment,multi-objectivity, adaptivity, etc., are identified. Then, heuristic andmeta-h...

We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a county or school district. This is a multicriteria optimization problem in which competing objectives must be considered, such as school capacity, busing costs, and socioeconomic distribution. Because of the complexity o...

Maximum entropy method and its heuristic generalizations are very useful in image processing. In this paper, we show that the use of fuzzy numbers enables us to naturally explain these heuristic methods.

In this thesis, I present several different methods for solving the Car Sequencing Problem. The process of scheduling vehicles along a production line has to take several constraints into account which are defined by the body shop, the paint shop and the assembly shop. I attached importance especially to the paint shop constraints, because no violations are allowed here. Beside the enhancement ...

We compare several techniques for scheduling shipment of customer orders for the Coors Brewing warehouse and production line. The goal is to minimize time at dock for trucks and railcars while also minimizing inventory. The techniques include a genetic algorithm, local search operators, heuristic rules, systematic search and hybrid approaches. Initial results show a hybrid genetic algorithm to ...

Jobshop problem is one of the most difficult classical scheduling problems. Very simple special cases of jobshop problem are strongly NP-hard. This paper deals with makespan minimization in jobshop scheduling problems with a specific blocking constraint met in several industrial problems. We also propose and define another new type of blocking constraint. After a problem description and the def...

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...