期刊
APPLIED SOFT COMPUTING
卷 44, 期 -, 页码 255-266出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2016.03.027
关键词
Order acceptance; Scheduling; Artificial bee colony algorithm; Class setups
资金
- National Natural Science Foundation of China [71171114, 71571101]
- College Graduates Research Innovation Plan of Jiangsu Province in China [KYZZ_0131]
This paper considers the order acceptance and scheduling problem in a single machine environment where each customer order is characterized by a known processing time, due date, revenue, and class setup time. The objective is to maximize the total revenue. Since the problem is computationally intractable, we first conduct a preliminary study of applying the basic artificial bee colony algorithm to address the problem under study. Specifically, we design appropriate neighborhood operators with respect to the problem. Based on the results of the preliminary study and the problem characteristics, an enhanced artificial bee colony algorithm is developed with a series of modifications. The extensive experimental results indicate that the enhanced artificial bee colony algorithm is both computationally efficient and effective for large sized problem instances. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据