A hybrid genetic Tabu search algorithm for minimising total completion time in a flexible job-shop scheduling problem

IF 1.9 4区工程技术 Q3 ENGINEERING, INDUSTRIAL

European Journal of Industrial Engineering Pub Date : 2020-01-01 DOI:10.1504/EJIE.2020.112479

Asma Fekih, Hatem Hadda, I. Kacem, Atidel B. Hadj-Alouane

{"title":"A hybrid genetic Tabu search algorithm for minimising total completion time in a flexible job-shop scheduling problem","authors":"Asma Fekih, Hatem Hadda, I. Kacem, Atidel B. Hadj-Alouane","doi":"10.1504/EJIE.2020.112479","DOIUrl":null,"url":null,"abstract":"The flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop problem in which an operation may be executed by any machine out of a set of candidate machines. This paper addresses the FJSP under partial and total flexibility with the objective of minimising the total completion time. The FJSP is one of the most complex problems. Thus, exact methods are not effective for solving this problem and heuristic approaches are generally used to find near optimal solutions within a reasonable computation time. We develop a hybrid approach combining genetic algorithms and the Tabu search metaheuristic. The resolution approach is based on a joint resolution of the inherent assignment and sequencing subproblems. To evaluate the performance of the proposed algorithms, several benchmark instances of FJSP are used. The experimental results prove the effectiveness and efficiency of the proposed hybridisation. [Received 28 May 2019; Revised 2 July 2019; Revised 2 November 2019; Accepted 11 January 2020]","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/EJIE.2020.112479","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}

引用次数: 4

Abstract

The flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop problem in which an operation may be executed by any machine out of a set of candidate machines. This paper addresses the FJSP under partial and total flexibility with the objective of minimising the total completion time. The FJSP is one of the most complex problems. Thus, exact methods are not effective for solving this problem and heuristic approaches are generally used to find near optimal solutions within a reasonable computation time. We develop a hybrid approach combining genetic algorithms and the Tabu search metaheuristic. The resolution approach is based on a joint resolution of the inherent assignment and sequencing subproblems. To evaluate the performance of the proposed algorithms, several benchmark instances of FJSP are used. The experimental results prove the effectiveness and efficiency of the proposed hybridisation. [Received 28 May 2019; Revised 2 July 2019; Revised 2 November 2019; Accepted 11 January 2020]

查看原文本刊更多论文

柔性作业车间调度问题中总完工时间最小化的混合遗传禁忌搜索算法

灵活作业车间调度问题(FJSP)是经典作业车间问题的扩展，其中一项操作可以由一组候选机器中的任何机器执行。本文以最小的总完工时间为目标，研究了部分柔性和全部柔性条件下的FJSP问题。FJSP是最复杂的问题之一。因此，精确的方法不能有效地解决这一问题，通常使用启发式方法在合理的计算时间内找到接近最优的解。我们开发了一种结合遗传算法和禁忌搜索元启发式的混合方法。该解决方法基于固有赋值子问题和排序子问题的联合解决。为了评估所提出算法的性能，使用了FJSP的几个基准实例。实验结果证明了该方法的有效性和高效性。[2019年5月28日收到;2019年7月2日修订;2019年11月2日修订;接受2020年1月11日]

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

European Journal of Industrial Engineering 工程技术-工程：工业

CiteScore

2.60

自引率

20.00%

发文量

审稿时长

6 months

期刊介绍： EJIE is an international journal aimed at disseminating the latest developments in all areas of industrial engineering, including information and service industries, ergonomics and safety, quality management as well as business and strategy, and at bridging the gap between theory and practice.