Abstract
In every system, where the resources to be allocated to a given set of tasks are limited, one is faced with scheduling problems, that heavily constrain the enterprise’s productivity. The scheduling tasks are typically very complex, and although there has been a growing flow of work in the area, the solutions are not yet at the desired level of quality and efficiency. The Genetic and Evolutionary Algorithms (GEAs) offer, in this scenario, a promising approach to problem solving, considering the good results obtained so far in complex combinatorial optimization problems. The goal of this work is, therefore, to apply GEAs to the scheduling processes, giving a special attention to indirect representations of the data. One will consider the case of the Job Shop Scheduling Problem the most challenging and common in industrial environments. A specific application, developed for a Small and Medium Enterprise, the Tipografia Tadinense, Lda, will be presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Goldberg and R. Lingle. Alleles, Loci and the Traveling Salesman Problem. In J. Grenfenstette, editor, Proc. of the 1st Intern. Conf. on Genetic Algorithms and their Applications, Hillsdale, New Jersey, 1985. Lawrence Erlbaum Assoc.
H. Mühlenbein. Evolution in time and space-the parallel genetic algorithm. In G. Rawlins, editor, Foundations of Genetic Algorithms, pages 316–337. Morgan-Kaufman, 1991.
J. Neves, M. Rocha, H. Rodrigues, M. Biscaia, and J. Alves. Adaptive Strategies and the Design of Evolutionary Applications. In Proc. of the Genetic and Evolutionary Computation Conference (GECCO99), Orlando, Florida, USA, 1999.
I.M. Oliver, D.J. Smith, and J. Holland. A Study of Permutation Crossover Operators on the Travelling Salesman Problem. In J. Grenfenstette, editor, Proc. of the 2nd Intern. Conf. on Genetic Algorithms and their Applications. Lawrence Erlbaum Assoc, July 1987.
M.G. Schleuter. ASPARAGOS-An Asynchronous Parallel Genetic Optimization Strategy. In J. D. Schafer, editor, Proc. of the 3rd ICGA. George-Mason Univ., Morgan Kaufman, 1989.
T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A Comparison of Genetic Sequencing Algorithms. In R. Belew and L. Booker, editors, Proc. of the 4th ICGA, San Diego, July 1991. Morgan-Kaufmann Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rocha, M., Vilela, C., Cortez, P., Neves, J. (2000). Viewing Scheduling Problems through Genetic and Evolutionary Algorithms. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_83
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive