Abstract
This paper starts by studying the performance of two interrelated genetic algorithms (GA) for the static Single Machine Scheduling Problem (SMSP). One is a single start GA, the other, called MetaGA, is a multi-start version GA. The performance is evaluated for total weighted tardiness, on the basis of the quality of scheduling solutions obtained for a limit on computation time. Then, a scheduling system, based on Genetic Algorithms is proposed, for the resolution of the dynamic version of the same problem. The approach used adapts the resolution of the static problem to the dynamic one in which changes may occur continually. This takes into account dynamic occurrences in a system and adapts the current population to a new regenerated population
Chapter PDF
References
Abdul-Razaq, T.S., C.N. Potts and L.N. Van Wassenhove, A survey for the Single-Machine Scheduling Total WT Scheduling Problem, Discrete Applied Mathematics, n°26, pp. 235–253, 1990
Adams, J., Balas, E. and Zawack, D., The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, vol. 34, n°3, pp. 391–401, 1988
Bagchi, Sugato et al., Exploring Problem-Specific Recombination Operators for Job-Shop Scheduling, Proc. Fourth Int. Conf. On Genetic Algorithms, Morgan Kaufman, pp. 10–17, 1991.
Baker, K.R, Introduction to Sequencing and Scheduling, Wiley, New York., 1974.
Brownie, J., Harhen, J., Shivnan, J., Production Management Systems, AdddisonWesley Publishing Co, 1988
Camarinha-Matos, L. M, Afsrmanesh, A., The Virtual Enterprise Concept, In IFIC TC5/PRODNET Working Conf. Infraestructures for Virtual Enterprises, Kluwer Academic Publishers, 1999
CrauDells, H.A.J., C.N.Potts and L.N.V. Wassenhove, Local Search Heuristics for the single machine total WT scheduling problem, Informs Journal on Computing, vol.10, n°3, pp. 341–350, 1998.
Davis, Lawrence, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
French, S., Sequencing and Scheduling-An Introduction to the Mathematics of Job-Shop, John Wiley and Sons, 1982
Goldtratt, E., Fox, R., The Race, North River Press, 1986
Holland, J.H., Adaptation in Natural and Artificial Systems, The MIT Press, 1992
Lawer, E.L., A pseudopolinomial algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics, pp. 331–342, 1977.
Madureira, Ana M., Meta-heuristics for the Single-Machine Scheduling Total Weighted Tardiness Problem, International Symposium on Assembly and Task Planning (ISATP’99), Portugal, 1999.
Michalewicz, Zbigniew, Genetic Algorithms + Data Structures = Evolution Programs, Third Revised and Extended Edition, Springer - Verlag Berlin Heidelberg, NewYork, 1992.
Morton, E. Thomas and David W. Pentico, Heuristic Scheduling Systems, John Wiley & Sons, 1993.
Potts, C.N. and L.N. Van Wassenhove, Single Machine Tardiness Sequencing Heuristics, IIE Transactions, vol. 23, n° 4, pp. 346–354, 1991
Rinnooy Kan, A.H.G., B.J. Lageweg and J.K. Lenstra, Minimising Total Costs in One-Machine Scheduling, Operations Research, Vol 23, n° 5, pp. 908–927, 1975.
Websitel, http://mscmga.ms.ic.ac.uk/jeb/orlib
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Madureira, A., Ramos, C., do Carmo Silva, S. (2000). A Genetic Algorithm for the Dynamic Single Machine Scheduling Problem. In: Camarinha-Matos, L.M., Afsarmanesh, H., Erbe, HH. (eds) Advances in Networked Enterprises. BASYS 2000. IFIP — The International Federation for Information Processing, vol 53. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35529-0_30
Download citation
DOI: https://doi.org/10.1007/978-0-387-35529-0_30
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4445-3
Online ISBN: 978-0-387-35529-0
eBook Packages: Springer Book Archive