摘要
提出求解存在加工批量为2的批处理设备的复杂单产品综合调度算法.该算法根据复杂产品具有的树状工艺结构的特点,先采用已有的优先级、短用时和长路径策略调度工序;当工序属于批处理设备时,再采用长路径、临界时间等待和先行工序短用时策略.理论分析和实例表明,提出的算法不仅能够解决存在加工批量为2的批处理设备的复杂单产品综合调度优化问题,而且复杂度不超过二次多项式.
A new algorithm is proposed to solve the integrated scheduling problem of single complex product with batch processing machines.The maximum lot-size that the batch processing machines can process is two.According to the feature of the structure of the processing tree that is provided with complex products,the algorithm first adopts the priority strategy,short-time strategy and long-path strategy to schedule operations.When the operations belong to the batching machine,the algorithm then adopts the long-path strategy,critical-time waiting strategy,and short-time of previous operation strategy to schedule operations.Theoretical analysis and examples show that the algorithm can solve the integrated scheduling problem of single complex products with batch processing machines on which the lot-size of operations being processed is two.In addition,the complexity is not more than quadratic polynomial.
出处
《北京工业大学学报》
EI
CAS
CSCD
北大核心
2011年第10期1470-1476,1481,共8页
Journal of Beijing University of Technology
基金
国家自然科学基金项目(60873019
61073043)
黑龙江省自然科学基金项目(F200901)
中国博士后科学基金(20090460880)
黑龙江博士后科学基金(LBH-Z09214)
哈尔滨市优秀学科带头人项目(2010RFXXG054
2011RFXXG015)
关键词
批处理设备
复杂产品
综合调度
树状工艺结构
临界时间
batch processing machine
complex product
integrated scheduling
structure of processing tree
critical-time
