点击次数：
发布时间：2019-03-12
论文类型：期刊论文
发表时间：2018-06-01
发表刊物：NEURAL COMPUTING & APPLICATIONS
收录刊物：Scopus、SCIE
卷号：29
期号：11
页面范围：1163-1170
ISSN号：0941-0643
关键字：Scheduling; Deteriorating job; Controllable processing time; Polynomial time algorithm
摘要：This article considered the single machine scheduling with controllable processing time (resource allocation) and deterioration effect concurrently. It discussed the minimization of three objectives, which involve the weighted sum of the makespan and the total resource consumption cost, the total resource consumption cost under the condition that the makespan (total flow time) is restricted to a fixed constant and the optimal resource allocation and the optimal job sequence is what we need to make decision. Considering the makespan constraint, it proved that these problems can be solved in polynomial time. A special case of the last problem can be solved in polynomial time with respect to the total flow time constraint.