A Client/Server Based Parallel Genetic Algorithm for Parallel Machines Scheduling Problem with Penalties
A problem of n independent jobs with different ready times and due dates to be scheduled on m parallel machines which aimed at minimizing the total tardiness penalties is considered. The decomposition and combination characteristics of the problem are studied. Based on the two characteristics a client/server based parallel calculation mode is designed, in which the server and client are responsible for the search of the global and local optimality, respectively. Following this mode, a parallel genetic algorithm which is composed of two cooperative processes assignment and ordering is developed. The experimental results are compared to an adapted algorithm to show the more prominent performances of the proposed algorithm.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Publication date: 2012-03-01
More about this publication?
- ADVANCED SCIENCE LETTERS is an international peer-reviewed journal with a very wide-ranging coverage, consolidates research activities in all areas of (1) Physical Sciences, (2) Biological Sciences, (3) Mathematical Sciences, (4) Engineering, (5) Computer and Information Sciences, and (6) Geosciences to publish original short communications, full research papers and timely brief (mini) reviews with authors photo and biography encompassing the basic and applied research and current developments in educational aspects of these scientific areas.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites