基于禁忌搜索的平行机多工厂供应链调度

中国机械工程 ›› 2012, Vol. 23 ›› Issue (6): 688-693.

基于禁忌搜索的平行机多工厂供应链调度

蒋大奎;李波

天津大学,天津,300072

出版日期:2012-03-26 发布日期:2012-04-13
基金资助:
新世纪优秀人才支持计划资助项目(NCET-06-0236);高等学校博士学科点专项科研基金资助项目(20100032110034)
Program for New Century Excellent Talents in University of Ministry of Education of China（No. NCET-06-0236）;
Research Fund for the Doctoral Program of Higher Education of China（No. 20100032110034）

Multi-plant Supply Chain Scheduling with Parallel Machines Based on Taboo Search Algorithm

Jiang Dakui;Li Bo

Tianjin University,Tianjin,300072

Online:2012-03-26 Published:2012-04-13
Supported by:

Program for New Century Excellent Talents in University of Ministry of Education of China（No. NCET-06-0236）;
Research Fund for the Doctoral Program of Higher Education of China（No. 20100032110034）

摘要/Abstract

摘要：

提出一类平行机多工厂供应链调度问题,从整体的角度优化订单分配、生产调度和运输调度。以交货期限内完成所有工件的生产和运输总成本最小化为目标,构建了问题的混合整数规划模型。设计了一种基于向量组编码结构的禁忌搜索算法以求解该问题。使用供应链调度策略和独立决策策略分别对算例进行求解,数据结果验证了供应链调度策略的优越性。禁忌搜索算法结果与CPLEX的求解结果对比表明,禁忌搜索算法有效可行。

关键词: 供应链调度, 多工厂, 平行机, 禁忌搜索

Abstract:

A multi-plant supply chain scheduling problem with parallel machines was proposed. Decisions of different functions including order assignment, production scheduling and batch delivery scheduling were integrated for a simultaneous optimization. A mixed integer programming model for the problem was built to minimize the production and distribution cost under the conditions that all jobs were finished before the due date. A taboo search algorithm with vector array representation was designed to solve the problem. Experiments adopting supply chain scheduling approach and decoupled approach respectively were conducted on the problem, and the results confirm the substantial advantages of the supply chain scheduling approach. Furthermore, compared with exact solutions provided by CPLEX, the results show that the designed algorithm is an efficient method for solving the problem.

Key words: supply chain scheduling, multi-plant, parallel machine, taboo search

中图分类号:

蒋大奎, 李波. 基于禁忌搜索的平行机多工厂供应链调度[J]. 中国机械工程, 2012, 23(6): 688-693.

JIANG Da-Kui, LI Bei. Multi-plant Supply Chain Scheduling with Parallel Machines Based on Taboo Search Algorithm[J]. China Mechanical Engineering, 2012, 23(6): 688-693.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.cmemo.org.cn/CN/

http://www.cmemo.org.cn/CN/Y2012/V23/I6/688

参考文献

[1]柏孟卓[1,2],陈峰[3],唐国春[1,4].供应链管理中生产和运输集成的排序问题[J].工业工程与管理,2007,12(5):47-50.
[2]Hall N G,Potts C N.Supply Chain Scheduling:Batching and Delivery[J].Operations Research,2003,51(4):566-584.
[3]Hall N G,Potts C N.The Coordination of Schedu-ling and Batch Deliveries[J].Annual of Operations Research,2005,135(1):41-64.
[4]Averbak I,Xue Zhihui.On-line Supply Chain Scheduling Problems with Preemption[J].European Journal of Operational Research,2007,181(1):500-504.
[5]Pundoor G,Chen Zhilong.Scheduling a Production-distribution System to Optimize the Tradeoff be-tween Delivery Tardiness and Total Distribution Cost[J].Naval Research Logistics,2005,52(6):571-589.
[6]Chen Zhilong,Pundoor G.Integrated Order Schedu-ling and Packing[J].Production and Operations Management,2009,18(6):672-692.
[7]Chen Zhilong,Vairaktarakis G L.Integrated Schedu-ling of Production and Distribution Operations[J].Management Science,2005,51(4):614-628.
[8]陈荣军[1,2],唐国春[2].平行机的供应链排序[J].系统科学与数学,2010(2):274-282.
[9]Chen Zhilong,Pundoor G.Order Assignment and Scheduling in a Supply Chain[J].Operations Re-search,2006,54(3):555-572.
[10]蒋大奎[1],李波[1].基于混合禁忌搜索算法的供应链排序问题[J].机械工程学报,2011,47(20):53-59.
[11]Chen Zhilong.Integrated Production and OutboundDistribution Sheduling:Review and Extensions[J].Operations Research,2010,58(1):130-148.
[12]Armentano V A,Shiguemoto A L,Lokketangen A.Tabu Search with Path Relinking for an Inte-grated Production-distribution Problem[J].Computers&Operations Research,2011,38(8):1199-1209.
[13]潘全科[1],朱剑英[2].一类解决Job Shop问题的禁忌搜索算法[J].中国机械工程,2006,17(5):536-539.
[14]Nowicki E,Smutanicki C.A Fast Taboo Search Al-gorithm for the Job-shop Problem[J].Manage-ment Science,1996,42(6):797-813.