摘要
考虑了同类机环境下多个工件加工和配送的排序问题.有多个制造商分布在不同位置,每个制造商处有一台机器可以加工工件.不同的机器对应着不同的加工速度和加工费用.工件生产完后需要运输到客户处,每一批配送需要花费一定的时间和费用.研究了排序理论中主要的3个目标函数,分析了问题的复杂性,对于这些问题给出了它们的最优算法.
In this paper,we consider integrated production and batch delivery scheduling with uniform machines.There are multiple manufacturers in different location,each of which having single machine.Different machines have different speed and processing cost.Processed jobs are delivered in batches to their customer.Each shipment incurs a delivery cost and takes a fixed amount of time.We consider three objective functions in scheduling theory,analyze the problem complexity and give optimal algorithms to solve the problems.
作者
王磊
任建峰
柏庆国
WANG Lei;REN Jianfeng;BAI Qingguo(Department of Business Administration,Qufu Normal University,Rizhao 276826)
出处
《系统科学与数学》
CSCD
北大核心
2019年第9期1428-1434,共7页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金(71771138,71702087)
山东省泰山学者工程专项经费(tsqn201812061)
山东省自然科学基金(ZR2019PA009,ZR2019MA061)
曲阜师范大学科技计划项目(xkj201505)资助课题
关键词
排序
多制造商
分批配送
动态规划
Scheduling
multiple manufacturers
batch delivery
dynamic programming