Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem
Journal of Automated Reasoning
An adaptive crossover distribution mechanism for genetic algorithms
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Enhancing genetic search to schedule a production unit
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Using a genetic algorithm to tackle the processors configuration problem
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Some Guidelines for Genetic Algorithms with Penalty Functions
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Using Genetic Algorithms to Schedule Flow Shop Releases
Proceedings of the 3rd International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
On the State of Evolutionary Computation
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
An empirical analysis of search in GSAT
Journal of Artificial Intelligence Research
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Systematic versus stochastic constraint satisfaction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A Glimpse of Constraint Satisfaction
Artificial Intelligence Review
Combining genetic algorithms with squeaky-wheel optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A GRASP approach for the extended car sequencing problem
Journal of Scheduling
Crossover operators for the car sequencing problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A study of greedy, local search, and ant colony optimization approaches for car sequencing problems
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
| Hi-index | 0.00 |
The car sequencing problem (CarSP) was seen as a challenge to artificial intelligence. The CarSP is a version of the job-shop scheduling problem, which is known to be NP-complete. The task in the CarSP is to schedule a given number of cars (of different types) in a sequence to allow the teams in each workstation on the assembly line to fit the required options (e.g. radio, sunroof) on the cars within the capacity of that workstation. In unsolvable problems, one would like to minimize the penalties associated with the violation of the capacity constraints. Previous attempts to tackle the problem either have been unsuccessful or have been restricted to solvable CarSPs only. In this paper, we report on promising results in applying a generic genetic algorithm, which we call GAcSP, to tackle both solvable and unsolvable CarSPs.