摘要
生产调度问题一直备受社会关注,尤其是制造业,因此,经典调度问题被研究学者提出,即实现一台机器加工一个工件的功能。随着社会对产品的需求量不断增加,实现一台机器同时加工多个工件的批调度问题被相继提出,其中差异工件尺寸调度问题最为复杂。论文研究的生产运输调度算法的复杂度超过了以上所有的批调度问题,涉及批调度和产品交付2个阶段,这是一个强NP难问题,深入研究具有重大意义。
The problem of production scheduling attracted much social attention,especially in manufacturing industry.Therefore,the classical scheduling problem is proposed by researchers,that is,realizing the function of one machine processing one workpiece.As the society's demand for products continues to increase,the batch scheduling problem to realize the simultaneous processing of multiple workpieces by one machine has been proposed one after another,among which the scheduling problem of different workpiece sizes is the most complex.The complexity of the algorithms of production and transportation scheduling studied in this paper exceeds all the above batch scheduling problems,involving two stages:batch scheduling and product delivery.This is a strong NP hard problem,and in-depth research is of great significance.
作者
卓雪雪
朱苍璐
郭杰
钱鹏
ZHUO Xue-xue;ZHU Cang-lu;GUO Jie;QIAN Peng(Anhui Sanlian University,Hefei 230601,China)
出处
《中小企业管理与科技》
2021年第31期124-127,共4页
Management & Technology of SME
基金
智能优化算法在物流配送中的应用研究,校级平台重点项目(项目编号:KJZD2020009)
区块链技术支撑下的车载网研究与应用,校级平台项目(项目编号:KJYB2020006)。
关键词
平行批处理机
不同尺寸的工件
蚁群优化算法
parallel batch processing machine
workpieces of different sizes
ant colony optimization algorithm
