文章基本信息

标题：Bi-objective Optimization of Multiple-route Job Shop Scheduling with Route Cost ⁎
本地全文：下载
作者：Feifeng Zheng ; Yang Sui
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2019
卷号：52
期号：13
页码：881-886
DOI：10.1016/j.ifacol.2019.11.241
语种：English
出版社：Elsevier
摘要：Multiple-route job shop scheduling problem (MRJSP) is an interesting variation of the job shop scheduling problem such that each job has one or more available processing routes, each of which is of a non-identical number of operations. We investigate the bi-objective MRJSP problem to minimize the makespan and the cost of selected processing routes in this work. Different processing routes of any job are of non-equal processing cost. We establish a bi-objective integer programming model, and devise an epsilon constraint algorithm together with a non-dominated sorting genetic algorithm II (NSGA-II). The epsilon constraint method produces exact solutions for small job instances, while NSGA-II can efficiently solve large job instances. Numerical experiments validate the proposed model and algorithms.
关键词：KeywordsMultiple-route job shop schedulingBi-objectiveMakespanRoute costNSGA-II