New codification schemas for scheduling with genetic algorithms

Authors:
Ramiro Varela;David Serrano;María Sierra
Affiliations:
Dep. of Computer Science, University of Oviedo, Artificial Intelligence Center, Gijón, Spain;Dep. of Computer Science, University of Oviedo, Artificial Intelligence Center, Gijón, Spain;Dep. of Computer Science, University of Oviedo, Artificial Intelligence Center, Gijón, Spain
Venue:
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Year:
2005

Citing 2
Cited 9

Scheduling by Genetic Local Search with Multi-Step Crossover

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Production scheduling and rescheduling with genetic algorithms

Evolutionary Computation

A Multiobjective Approach to Fuzzy Job Shop Problem Using Genetic Algorithms

Current Topics in Artificial Intelligence
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

Journal of Heuristics
Genetic algorithm for job-shop scheduling with operators

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Comparing schedule generation schemes in memetic algorithms for the job shop scheduling problem with sequence dependent setup times

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Genetic algorithms hybridized with greedy algorithms and local search over the spaces of active and semi-active schedules

CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
A competent memetic algorithm for complex scheduling

Natural Computing: an international journal
Scheduling with memetic algorithms over the spaces of semi-active and active schedules

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Job shop scheduling with transportation delays and layout planning in manufacturing systems: a multi-objective evolutionary approach

AIS'12 Proceedings of the Third international conference on Autonomous and Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Codification is a very important issue when a Genetic Algorithm is designed to dealing with a combinatorial problem. In this paper we introduce new codification schemas for the Job Shop Scheduling problem which are extensions of two schemas of common use, and are worked out from the concept of underlying probabilistic model. Someway the underlying probabilistic model of a codification schema accounts for a tendency of the schema to represent solutions in some region of the search space. We report results from an experimental study showing that in many cases any of the new schemas results to be much more efficient than conventional ones due to the new schema tends to represent more promising solutions than the others. Unfortunately the selection in advance of the best schema for a given problem instance is not an easy problem and remains still open.