Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
复制标题
DOI：
10.1142/s0217595915500335
复制
发表时间：
2015-10
期刊：
影响因子：
--
通讯作者：
Xinjun Li;Jian-Jun Wang;Xue-Ru Wang
中科院分区：
文献类型：
--
作者：
Xinjun Li;Jian-Jun Wang;Xue-Ru Wang
本文研究了工件具有学习效应、工件退化和加工时间凸依赖于资源的单机排序问题，即，工件的处理时间是其开始时间、其在序列中的位置和其凸资源分配的函数。目标是分别求出最优的工件序列和最优的凸资源分配，使包含完工时间、总完工（等待）时间、完工（等待）时间差和总资源成本的成本函数最小。证明了该问题可以在多项式时间内求解。
This paper considers single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, i.e., the processing time of a job is a function of its starting time, its position in a sequence and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately to minimize a cost function containing makespan, total completion (waiting) time, total absolute differences in completion (waiting) times and total resource cost. It is proved that the problem can be solved in polynomial time.