极小化最大完工时间的批到达同时加工排序问题  

Minimizing makespan on a batching machine with batch arrivals

作　　者：井彩霞[1] 钱省三[1] 马良[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《上海理工大学学报》2009年第1期54-58,共5页Journal of University of Shanghai For Science and Technology

基　　金：上海市重点学科资助项目(S30504);国家教育部博士点基金资助项目(20050252008)

摘　　要：考虑工件成批到达的同时加工排序问题,目标函数为极小化最大完工时间.给出模型在特殊情况下的统筹算法和针对一般情况的局部统筹算法,并通过大量的实例计算来验证两启发式方法的有效性.Scheduling on a batching machine in the presence of batch arrivals is considered. To minimize the makespan of the model, two heuristics are presented, one is called plan as a whole （PAAW） algorithm to the special case, and the other is called locally plan as a whole （LPAAW） algorithm to the general problem. Extensive computational experiment results indicate that they both have excellent average performance.

关 键 词：运筹学 同时加工排序 启发式算法 成批到达 批加工 最大完工时间 

分 类 号：O223[理学—运筹学与控制论]