Abstract
Recent techniques in multi-mode project scheduling and multiobjective optimization with Evolutionary Algorithms are combined in this paper. We propose a single step Evolutionary Algorithm to find multiple Pareto-optimal solutions to the multi-mode resource-constrained project scheduling problem which make it possible that the decision maker can be able to choose the most appropiate solution according to the current decision environment.
The author thanks the Instituto de Fomento de la Region de Murcia for its financing through the Seneca Program.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bierwirth, C.: A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms. Department of Economics, University of Bremen, Germany
Bierwirth, C., Mattfeld, D.C., Kopfer H.: On Permutaction Representations for Scheduling Problems. Department of Economics, University of Bremen, Germany
Fang, H.: Genetic Algorithms in Timetabling and Scheduling. PhD. Department of Artificial Intelligence, University of Edinburgh (1991)
Fonseca, CM, Fleming, P.J.: Genetic algorithms for multi-objective optimization: formulation, discussion and generalization, in S. Forrest (ed.), Genetic Algorithms: Proc. of the Fifth Intern. Conf, Morgan Kaufmann, San Mateo (1993) 416–423
Fonseca, C.M., Fleming, P.J.: An overview of evolutionary algorithms in multiobjective optimization, Evolutionary Computation, vol. 3, no. 1, MIT Press (1995)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley (1989)
Hartmann, S.: Project Scheduling with Multiple Modes: A Genetic Algorithm. Technical Report 435. Instituten fr Betriebswirtschaftslehre. Universitt Kiel, Germany (1997)
Horn, J., Nafpliotis, N.: Multiobjective optimization using the niched pareto genetic algorithm, IlliEAL Report No. 93005 (1993)
Kolish, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resources-constrained project scheduling problems. Management Science, Vol. 41, 1693–1703
Kolish, R., Hartmann, S.: Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. Handbook on Recent Advances in Project Scheduling, edited by J. Weglarz and published by Kluwer (1998)
Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation, vol. 2, no. 3 (1995) 221–248
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gómez-Skarmeta, A.F., Jiménez, F., Ibáñez, J. (1999). Pareto-optimality in Scheduling Problems. In: Reusch, B. (eds) Computational Intelligence. Fuzzy Days 1999. Lecture Notes in Computer Science, vol 1625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48774-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-48774-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66050-7
Online ISBN: 978-3-540-48774-6
eBook Packages: Springer Book Archive