摘要
在两车间具备相同设备资源的生产条件时,需要考虑产品完成时间和车间之间工序移动次数尽可能少的问题。为此,提出两车间可调度工序均衡处理的综合调度算法。为减少单件复杂产品的完成时间,针对可调度工序的灵活性、并行性和两车间设备相同的条件,采用可调度工序车间均衡策略进行分组。为减少工序移动次数,按分组工序车间确定策略分配工序所在车间,并进行调度。实例结果表明,该算法可实现两车间综合调度,且产品完成时间和车间之间的工序移动次数较少。
Aiming at the production condition that two workshops have the same equipment resources, integrated scheduling algorithm with equalization processing of schedulable processes in two workshops is put forward considering the issue of product completion time and the number of processes moving as little as possible in the two workshops. In order to reduce the completion time of the single complex product, the algorithm considers the flexibility and parallelism of schedulable processes and the condition of two workshops having the same equipments, using workshops equilibrium strategies to group the schedulable processes. In order to reduce the number of processes moving, assigning the processes to workshop and dispatch them in accordance with proposed determination of processes workshop. Example results show that the algorithm can achieve integrated scheduling of the two workshops and product completion time as short as possible and the number of processes moving as little as possible in quadratic complexity.
出处
《计算机工程》
CAS
CSCD
2014年第1期295-300,304,共7页
Computer Engineering
基金
国家自然科学基金资助项目(60873019
61370086)
黑龙江省自然科学基金资助项目(F201101)
黑龙江省高校重点实验室开放课题基金资助项目(2012DJ-003)
黑龙江省教育厅科技基金资助项目(12531105)
黑龙江省博士后科研启动基金资助项目(LBH-Q13092)
关键词
单件复杂产品
两车间
可调度工序
车间均衡
车间确定
综合调度算法
single complex product
two workshops
schedulable processes
workshop equilibrium
workshop determination
integratedscheduling algorithm
