Abstract
The present work deals with the problem of allocating a number of non identical tasks in a parallel system. The model assumes that the system consists of a number of identical processors and that only one task may be executed on a processor at a time. All schedules and tasks are nonpreemptive. Graham’s
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
Graham R.L.: Bounds on Multiprocessing Anomalies and Packing Algorithms. Proceedings of the AFIPS 1972 Spring Joint Computer Conference, pp 205–217, (1972).
Esquivel S., Leiva A., Gallard R: Multiplicity in Genetic Algorithms to Face Multicriteria Optimization. Proceedings of the Congress on Evolutionary Algorithms (IEEE), Washington DC, pp 85–90, (1999).
Horowitz E. and Sahni S.: Exact and Approximate Algorithms for Scheduling non Identical Processors. Journal of the ACM, vol. 23,No. 2, pp 317–327, (1976).
Ercal F.: Heuristic Approaches to Task Allocation for Parallel Computing. Doctoral Dissertation, Ohio State University, (1988).
Reeves C.R., Karatza H.: Dynamic Sequencing of a Multiprocessor System; a Genetic Algorithnm, Proc. of 1st International Conference on Artificial Neural Nets and Genetic Algorithms. Springer Verlag (1993).
Seredynski F.: Task Scheduling with use of Classifier Systems. AISB. International Workshop 1997: Selected Papers, Lecture Notes in Computers Sciences 1305, pp 287–306, Springer, (1997).
Tsang E.P.K., Voudouris C.: Fast Local Search and Guided Local Search and their Applications to British Telecom’s Workforce Scheduling Problem. Operations Research Letters 20(3), pp 129–137 (1997)
Yue K.K., Lilja D.J.: Designing Multiprocessor Scheduling Algorithms using a Distributed Genetic Algorithm. Evolutionary Algorithms in Engineering Applications, pp 207–222. Springer (1997).
Kidwell M.: Using Genetic Algorithms to Schedule Tasks on a Bus-based System. Proceedings of the 5th International Conference on Genetic Algorithms, pp 368–374, (1993).
Krause M., Nissen V.,: On Using Penalty Functions and Multicriteria Optimization Techniques in Facility Layout. Evolutionary Algorithms for Management Applications, ed J. Biethahn and V. Nissen (Berling: Springer), pp 153–166, (1995).
Lin S-C, Goodman E.D, Punch W.F,: Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems. Evolutionary Programming VI, Lecture Notes in Computer Sciences 1213, pp 383–393, Springer (1997).
Murata T., Ishibuchi H.: Positive and Negative Combinations and Effects of Crossover and Mutation Operators in Sequencing Problems. Proc. of 1996 IEEE International Conference on Evolutionary Computation, pp 170–175. IEEE (1996).
Sannomiya N., Iima H.: Applications of Genetic Algorithms to Scheduling Problems in Manufacturing Processing. Proc. of 1996 IEEE International Conference on Evolutionary Computation, pp 523–528, IEEE (1996).
Syswerda G.,: Scheduling Optimisation using Genetic Algorithms. Davis, L.,Editor, Handbook of Genetic Algorithms, chapter 21, pp 332–349, Van Nostrand Reinhold, New York, (1991).
Yamada T., Nakano R.: Scheduling by Genetic Local Search with Multi-step crossover. Parallel Problem Solving from Nature, PPSN IV, Lecture Notes in Computer Sciences 1141, pp 960–969, Springer (1996).
Yamada T., Reeves C.R.: Solving the Csum Permutations Flow Shop Scheduling Problem by Genetic Local Search. ICEC (1998).
Yamada, T., Reeves C.R.: Permutation Flow Scheduling by Genetic Local Search. Proc. of the 2nd International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pp 232–238 (1997).
Withley D., Starkweather T., Fuquay D’A: Scheduling Problems and Travelling Salesman: The Genetic Edge Recombination Operator. Proceedings of the 3th International Conference on Genetic Algorithms, pp 133–140. Morgan Kaufmann Publishers, Los Altos CA, (1989).
Fox G.C.: A Review of Automatic Load Balancing and Decomposition Methods for the Hipercube. In M Shultz, ed., Numerical Algorithms for Modern Parallel Computer Architectures, Springer Verlag, pp 63–76, (1988).
Bagchi S., Uckum S., Miyabe Y., Kawamura K.: Exploring Problem Specific Recombination Operators for Job Shop Scheduling. Proceedings of the 4th International Conference on Genetic Algorithms, pp 10–17 (1991)
Bruns R.: Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling. Proceedings of the 5th International Conference on Genetic Algorithms, pp 352–359, (1993).
Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, Third, Extended Edition, (1996).
Esquivel S., Ferrero S., Gallard R., Alfonso H. Salto C., Schütz M.:Enhanced evolutionary algorithms for single and multiobjective optimization in the job shop scheduling problem. To appear in the Knowledge Based System Journal, Elsevier 2001.
Pinedo M.,: Scheduling: Theory, Algorithms and Systems. Prentice Hall International Series in Industrial and Systems Engineering, (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esquivel, S., Gatica, C., Gallard, R. (2001). Conventional and Multirecombinative Evolutionary Algorithms for the Parallel Task Scheduling Problem. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive