Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method

被引:46
作者
Cheng, Ba-Yi [1 ,2 ]
Leung, Joseph Y. -T. [1 ,2 ,3 ]
Li, Kai [1 ,2 ]
机构
[1] Hefei Univ Technol, Sch Management, Hefei 230009, Peoples R China
[2] Minist Educ, Key Lab Proc Optimizat & Intelligent Decis Making, Hefei 230009, Peoples R China
[3] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07012 USA
基金
高等学校博士学科点专项科研基金; 中国国家自然科学基金;
关键词
Scheduling; Production; Distribution; Ant colony optimization; Heuristics; BATCH PROCESSING MACHINE; NONIDENTICAL JOB SIZES; GENETIC ALGORITHMS; MAKESPAN; DELIVERY; COORDINATION;
D O I
10.1016/j.cie.2015.02.017
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we consider an integrated scheduling problem of production and distribution for manufacturers. In the production part, the batch-processing machines have fixed capacity and the jobs have arbitrary sizes and processing times. Jobs in a batch can be processed together, provided that the total size of the jobs in the batch does not exceed the machine capacity. The processing time of a batch is the largest processing time of all the jobs in the batch. In the distribution part, the vehicles have identical transport capacity and all the deliveries are done by a third-party logistic (3PL) provider. The objective is to minimize the total cost of production and distribution for the manufacturer. Since the problem is NP-hard in the strong sense, we propose an improved ant colony optimization method to solve the production part, and a heuristic method for the distribution part. We derive a lower bound for the optimal total cost. We generate a large number of random data to test the performance of the proposed heuristic versus the lower bound. Our results show that the performance of the heuristic is excellent while the running time is no more than five seconds for 200 jobs. (c) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:217 / 225
页数:9
相关论文
共 38 条
[1]   Supply chain scheduling: Sequence coordination [J].
Agnetis, Alessandro ;
Hall, Nicholas G. ;
Pacciarelli, Dario .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (15) :2044-2063
[2]   Coordination of production and interstage batch delivery with outsourced distribution [J].
Agnetis, Alessandro ;
Aloulou, Mohamed Ali ;
Fu, Liang-Liang .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (01) :130-142
[3]   On-line supply chain scheduling problems with preemption [J].
Averbakh, Igor ;
Xue, Zhihui .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) :500-504
[4]   An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows [J].
Balseiro, S. R. ;
Loiseau, I. ;
Ramonet, J. .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (06) :954-966
[5]  
Carter C.B., 2013, Ceramic materials science and engineering
[6]   Supply chain scheduling: Conflict and cooperation in assembly systems [J].
Chen, Zhi-Long ;
Hall, Nicholas G. .
OPERATIONS RESEARCH, 2007, 55 (06) :1072-1089
[7]   Integrated Production and Outbound Distribution Scheduling: Review and Extensions [J].
Chen, Zhi-Long .
OPERATIONS RESEARCH, 2010, 58 (01) :130-148
[8]   Order assignment and scheduling in a supply chain [J].
Chen, ZL ;
Pundoor, G .
OPERATIONS RESEARCH, 2006, 54 (03) :555-572
[9]   Integrated scheduling of production and distribution operations [J].
Chen, ZL ;
Vairaktarakis, GL .
MANAGEMENT SCIENCE, 2005, 51 (04) :614-628
[10]   Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes [J].
Cheng, Bayi ;
Yang, Shanlin ;
Hu, Xiaoxuan ;
Li, Kai .
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2014, 45 (03) :571-578