{"title":"Two-machine chain-reentrant ow shop with the no-wait constraint","authors":"Karima Amrouche, Mourad Boudhar, Nazim Sami","doi":"10.1504/ejie.2020.10030254","DOIUrl":null,"url":null,"abstract":"This paper addresses the chain-reentrant flow shop scheduling problem with two machines and n non-preemptive jobs in the presence of the no-wait constraint; we assume that each job passes from the first machine to the second and returns back to the first machine. The objective is to minimise the makespan. The general problem is NP-hard in the strong sense. Based on a dynamic programming algorithm, we prove that the problem is polynomially solvable when the execution order of the jobs through the machines is a fixed permutation. For the resolution of the general problem, we propose a linear mathematical model, local search heuristics, a simulated annealing metaheuristic and lower bounds with numerical experiments. [Received: 8 February 2019; Revised: 19 June 2019; Revised: 26 August 2019; Revised: 8 October 2019; Revised: 9 November 2019; Accepted: 11 November 2019]","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/ejie.2020.10030254","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 2
Abstract
This paper addresses the chain-reentrant flow shop scheduling problem with two machines and n non-preemptive jobs in the presence of the no-wait constraint; we assume that each job passes from the first machine to the second and returns back to the first machine. The objective is to minimise the makespan. The general problem is NP-hard in the strong sense. Based on a dynamic programming algorithm, we prove that the problem is polynomially solvable when the execution order of the jobs through the machines is a fixed permutation. For the resolution of the general problem, we propose a linear mathematical model, local search heuristics, a simulated annealing metaheuristic and lower bounds with numerical experiments. [Received: 8 February 2019; Revised: 19 June 2019; Revised: 26 August 2019; Revised: 8 October 2019; Revised: 9 November 2019; Accepted: 11 November 2019]
期刊介绍：
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
