期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 80, 期 -, 页码 125-131出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2014.11.024
关键词
Flow shop scheduling problem; Agents; Variable neighborhood search; Feasibility model
资金
- Natural Science Foundation of China [61374151]
Multi-agent scheduling in flow shop environment is seldom considered. In this paper flow shop scheduling problem with two agents is studied and its feasibility model is considered, in which the goal is to minimize the makespan of the first agent and the total tardiness of the second agent simultaneously under the given upper bounds. A simple variable neighborhood search (VNS) algorithm is proposed, in which a learning neighborhood structure is constructed to produce new solutions and a new principle is applied to decide if the current solution can be replaced with the new one. VNS is tested on a number of instances and the computational results show the promising advantage of VNS when compared to other algorithms of the problem. (C) 2014 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据