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

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

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

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.