期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 141, 期 1, 页码 14-23出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2012.06.003
关键词
Scheduling; Order acceptance; Artificial bee colony algorithm; Revenue
资金
- National Natural Science Foundation of China [71171114]
- NUST Research Funding [2011XQTR10]
- Shipping Research Centre of The Hong Kong Polytechnic University
- Qing Lan Project
We consider a two-stage make-to-order production system characterized by limited production capacity and tight order due dates. We want to make joint decisions on order acceptance and scheduling to maximize the total net revenue. The problem is computationally intractable. In view of the fact that artificial bee colony algorithm has been shown to be an effective evolutionary algorithm to handle combinatorial optimization problems, we first conduct a pilot study of applying the basic artificial bee colony algorithm to treat our problem. Based on the results of the pilot study and the problem characteristics, we develop a modified artificial bee colony algorithm. The experimental results show that the modified artificial bee colony algorithm is able to generate good solutions for large-scale problem instances. (c) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据