基于预排序的并行批处理过程调度模型  

A Scheduling Model of Parallel Batch Process Based on Pre-ordering

作　　者：薛耀锋[1] 袁景淇[1] 

机构地区：[1]上海交通大学自动化系,上海200240

出　　处：《上海交通大学学报》2007年第8期1330-1333,共4页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目(60574038)

摘　　要：针对并行批处理调度过程,以总提前完成时间最小化为目标函数,建立了一个基于交货期的调度模型.该模型考虑了订单的交货期等约束条件,将订单和设备之间的分配关系表达为0-1变量,采用预排序方法确定订单的处理顺序.采用分支定界法对模型进行求解,并与已有模型的计算结果比较,证明所提出的模型整数变量少且容易求解.For a parallel batch process, a scheduling model based on due dates was built to minimize the total earliness. Considering the due dates of orders and other constraint conditions, the assignment of orders and units is described by a set of binary variables. The processing sequence of orders is determined by the pre-ordering method. The model is solved by Branch and Bound approach. The computational study shows that the proposed model achieves significant improvement over the model in the literatures.

关 键 词：批处理过程 交货期 预排序 调度 模型 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]