最小化误工个数的越库调度模型与启发式算法  

Cross Docking Scheduling Model and Heuristics to Minimize the Number of Tardy Jobs

作　　者：俞亮[1] 陈峰[1] 

机构地区：[1]上海交通大学工业工程与物流工程系,上海200240

出　　处：《上海交通大学学报》2009年第12期1984-1988,共5页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目(70771063);国家自然科学基金重大国际(地区)合作研究项目(20710015)

摘　　要：研究两阶段越库调度问题,目标为最小化误工个数.建立该问题的混合线性整数规划模型,在小规模情形下,利用ILOG Cplex求得精确解,并提出了基于最早交货期(EDD)的启发式算法.为评价启发式算法的计算性能,进一步构造问题的最优解下界算法,分别对小规模和中等规模问题进行数值实验,并对比启发式算法结果与精确解及下界的损失比.结果表明,所提出的启发式算法具有高效性.This paper studied the two-stage cross docking scheduling problem with the objective to minimize the number of tardy jobs. Firstly, a mixed integer linear programming is built. Secondly, an EDD-based heuristics is presented to solve this problem in large scale. Moreover, a lower bound is constructed. Finally, computational experiments are given to show that our heuristics can solve the problem efficiently.

关 键 词：物流优化 调度 启发式算法 

分 类 号：F253.4[经济管理—国民经济]