Ant colony optimization for joint scheduling of production, inventory and distribution

被引:1
|
作者
Cheng, Bayi [1 ,2 ]
Li, Ming [1 ,2 ]
机构
[1] School of Management, Hefei University of Technology, Hefei
[2] Key Laboratory of Process Optimization and Intelligent Decision-Making of Ministry of Education, Hefei University of Technology, Hefei
来源
Jixie Gongcheng Xuebao/Journal of Mechanical Engineering | 2015年 / 51卷 / 12期
关键词
Ant colony optimization; Arbitrary-size jobs; Batch-processing machines; Joint scheduling;
D O I
10.3901/JME.2015.12.202
中图分类号
学科分类号
摘要
A three-stage joint scheduling problem for manufacturers with batch-processing machines and arbitrary-size jobs is considered. The objective is to minimize total cost for production, inventory and distribution. In the production part, jobs have arbitrary sizes and are processed in batches on machines as long as the total size of jobs in a batch does not exceed the machine capacity. The processing of a batch cannot be interrupted until all the jobs in the batch are completed. Completed jobs are put in inventory before distribution. In the distribution part, products are delivered with identical vehicles of third-party logistics company. The model of the problem is presented using integer programming and it is shown to be NP-hard. A lower bound of optimal cost is derived. Designing an improved ant colony optimization method is proposed to minimize total cost. The candidate list is generated by classification of jobs to reduce the running time. In order to avoid local optimum, the pheromone is updated with a rotation scheme. The performance of the algorithm is tested by experiments where 48 levels of instances are developed and the results show the effectiveness of the proposed algorithm. ©, 2015, Journal of Mechanical Engineering. All right reserved.
引用
收藏
页码:202 / 212
页数:10
相关论文
共 28 条
  • [1] Hall N.G., Potts C.N., Supply chain scheduling: Batching and delivery, Operations Research, 51, 4, pp. 566-584, (2003)
  • [2] Selvarajah E., Steiner G., Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs, Operations Research, 57, 2, pp. 426-438, (2009)
  • [3] Sawik T., Coordinated supply chain scheduling, International Journal of Production Economics, 120, 2, pp. 437-451, (2009)
  • [4] Yeung W.K., Choi T.M., Cheng T.C.E., Supply chain scheduling and coordination with dual delivery models and inventory storage cost, International Journal of Production Economics, 132, 2, pp. 223-229, (2011)
  • [5] Osman H., Demirli K., Economic lot and delivery scheduling problems for multi-stage supply chains, International Journal of Production Economics, 136, 2, pp. 275-286, (2012)
  • [6] Yao J., Zhou G., Analysis of supply chain optimization planning and scheduling mass customization, Journal of Management Science in China, 6, 5, pp. 58-64, (2003)
  • [7] Chen Z.L., Hall N.G., Supply chain scheduling: Conflict and cooperation in assembly systems, Operations Research, 55, 6, pp. 1072-1089, (2007)
  • [8] Agnetis A., Hall N.G., Pacciarelli D., Supply chain scheduling: Sequence coordination, Discrete Applied Mathematics, 154, 15, pp. 2044-2063, (2006)
  • [9] Torabi S.A., Ghomi S.M.T., Karimi B., A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, European Journal of Operational Research, 173, 1, pp. 173-189, (2006)
  • [10] Chen Z.L., Vairaktarakis G.L., Integrated scheduling of production and distribution operations, Management Science, 51, 4, pp. 614-628, (2005)