文章基本信息

标题：The chain-reentrant shop with the no-wait constraint
本地全文：下载
作者：Karim Amrouche ; Mourad Boudhar ; Farouk Yalaoui 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2016
卷号：49
期号：12
页码：414-418
DOI：10.1016/j.ifacol.2016.07.641
语种：English
出版社：Elsevier
摘要：We consider a chain reentrant shop problem with m machines, in which a no-wait constraint is imposed. Each job goes through m machines in a fixed order and return back to the first machine for its last operation. We seek to minimize the overall finish time (makespan). We first proof some new NP-hard problems in the case of two machines. For the resolution of the general problem we propose a genetic algorithm with numerical experiments.
关键词：Schedulingflowshopchain-reentrantno-waitNP-hardnessgenetic algorithms