DISTRIBUTED FLOW SHOP SCHEDULING PROBLEM WITH LEARNING EFFECT, SETUPS, NON-IDENTICAL FACTORIES, AND ELIGIBILITY CONSTRAINTS
DOI:
https://doi.org/10.23055/ijietap.2022.29.1.7769Keywords:
distributed flow shop scheduling problem, setup times, learning effect, mathematical model, iterated tabu search algorithmAbstract
In the flow shop scheduling, the route of each job is the same, and the order of the jobs on the machines is determined. In the distributed flow shop scheduling (DFSS) problem, on the other hand, the assignment of jobs to factories is carried out in addition to the determination of the order of the jobs. Therefore, the DFSS problem is both an assignment and a sequencing problem. This study considers machine factory-dependent setup times, non-identical factories, position-based learning effects on processing times and setup times, and factory eligibility constraints for the DFSS problem. The study is the first to consider all these real-life features encountered in the DFSS problem. The addressed problem is defined considering the scheduling problem of Enterprise Resource Planning (ERP) projects. A mathematical model is proposed for the solution of the problem. Since the problem is NP-hard, a multi-start iterative tabu search (ITS) algorithm is proposed to solve large-scale problems. An encoding schema, decoding algorithm, and multi-start strategy are proposed to solve the problem with the ITS algorithm. The parameters of the proposed algorithm are determined by the Taguchi experimental design method. The success of the proposed multi-start ITS algorithm is demonstrated by comparing it with the state-of-the-art genetic algorithm (GA), simulated annealing (SA) algorithm, and tabu search (TS) algorithm through test problems and a real-world application. Statistical analysis is performed to determine the performance of the proposed heuristic. As a result, the proposed heuristic algorithm is found to be more successful than other algorithms in the literature.
Published
How to Cite
Issue
Section
License
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.
