摘要
研究云制造环境下资源受限的同类机调度问题,目标函数为在不超过成本上限的情况下,极小化最大完工时间,每台机器有不同的机器速度和不同的固定加工成本。针对工件长度相同和不同的两种情况分别给出了一个近似算法,并得到算法的最坏情况界。
In this paper,resource-constrained uniform parallel machine scheduling in cloud manufacturing is studied.The goal is to minimize the makespan within a given cost.Each machine has different speed and fixed machining cost.Approximation algorithms are given for both cases of the jobs with same sizes or different sizes,and their worst-case boundaries are gained,respectively.
出处
《浙江理工大学学报（自然科学版）》
2018年第2期206-210,共5页
Journal of Zhejiang Sci-Tech University(Natural Sciences)
基金
国家自然科学基金项目(11571013)
关键词
资源受限
同类机调度
完工时间
近似算法
resource-constrained
uniform parallel machine scheduling
makespan
approximation algorithm
