MULTIMODAL OPTIMIZATION OF JOB-SHOP SCHEDULING PROBLEMS USING A CLUSTERING-GENETIC ALGORITHM BASED APPROACH
Keywords:Multimodal optimization, Job-Shop Scheduling Problem (JSSP), k-means clustering algorithm, Genetic Algorithm
AbstractThough ample work has been done in optimization of job shop scheduling problems (JSSPs), very few techniques can satisfy the requirement of modern day workshop i.e. providing multiple schedules that achieve the desired goal. These techniques also do not provide a good balance between converging to the optimal solution while finding multiple optimal solutions. To overcome this obstacle, a new algorithm is proposed, by combining k-means clustering algorithm and Genetic Algorithm (GA), for the multimodal optimization of JSSPs. In the proposed algorithm, k-means clustering algorithm is first utilized to cluster the individuals of every generation into different clusters, based on some machine sequence related features under the assumption that different global optima will have different features. Next the adapted genetic operators are applied to the individuals belonging within the same cluster with the aim of searching for global optima within each cluster independently. The performance of the proposed algorithm is measured by its application to the multimodal optimization of benchmark JSSPs and comparing its performance against other multimodal optimization algorithms. The results of the case studies show that the algorithm has better average optimal value and is also capable of finding multiple optimal solutions.
How to Cite
The Author(s) must formally transfer each article's copyright before publication in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING. Such transfer enables the Journal to defend itself against plagiarism and other forms of copyright infringement. Your cooperation is appreciated.
You agree that the copyright of your article to be published in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE is hereby transferred, throughout the World and for the full term and all extensions and renewals thereof, to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE.
The Author(s) reserve(s): (a) the trademark rights and patent rights, if any, and (b) the right to use all or part of the information contained in this article in future, non-commercial works of the Author's own, or, if the article is a "work-for-hire" and made within the scope of the Author's employment, the employer may use all or part of the information contained in this article for intra-company use, provided the usual acknowledgments are given regarding copyright notice and reference to the original publication.
The Author(s) warrant(s) that the article is Author's original work and has not been published before. If excerpts from copyrighted works are included, the Author will obtain written permission from the copyright owners and credit the article's sources.
The author also warrants that the article contains no libelous or unlawful statements and does not infringe on the rights of others. If the article was prepared jointly with other Author(s), the Author agrees to inform the co-Author(s) of the terms of the copyright transfer and to sign on their behalf; or in the case of a "work-for-hire," the employer or an authorized representative of the employer.
The journal does not provide the author copy of the final paper when it is published. The author(s) can make(s) a subscription to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE if they want to get the final paper that has already been published.
The journal is registered with the Library of Congress (ISSN # 1943-670X). All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the journal.
The author reserves patent and trademark rights and the right to use all or part of the information contained in the article in future non-commercial works.