Application of parallel multipopulation genetic algorithms to dynamic job-shop scheduling

59Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes the use of parallel multipopulation genetic algorithms (GAs) to meet the dynamic nature of job-shop scheduling. A modified genetic technique is adopted by using a specially formulated genetic operator to provide an efficient optimization search. The proposed technique has been successfully implemented using the programming language MATrix LABoratory (MATLAB), providing a powerful tool for job-shop scheduling. Comparisons indicate that the proposed genetic algorithm has successfully improved upon the solution obtained from conventional approaches, particularly in coping with job-shop scheduling.

Cite

CITATION STYLE

APA

Qi, J. G., Burns, G. R., & Harrison, D. K. (2000). Application of parallel multipopulation genetic algorithms to dynamic job-shop scheduling. International Journal of Advanced Manufacturing Technology, 16(8), 609–615. https://doi.org/10.1007/s001700070052

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free