期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 107, 期 -, 页码 12-24出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2017.02.019
关键词
Job shop scheduling; Maximum earliness; Maximum tardiness; Imperialist competitive algorithm; Neighborhood search
The sum of the maximum earliness and tardiness criteria is a new objective function for the job shop scheduling problem introduced in this work. A mixed integer linear programming (MIP) formulation of the job shop scheduling problem with the new objective function is developed. We design a set of experiments where we validate the MIP model on different problem sizes. This is one of the most difficult problems in combinatorial optimization, with even modest sized instances being computationally intractable. Getting inspiration from a number of advances in solving this notoriously difficult problem, we develop a new approximate optimization approach, which is based on the imperialist competitive algorithm hybridized with an efficient neighborhood search. The effectiveness of the proposed approach is demonstrated through an experimental evaluation. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据