Hits:

Indexed by:期刊论文

Date of Publication:2018-06-01

Journal:NEURAL COMPUTING & APPLICATIONS

Included Journals:SCIE、Scopus

Volume:29

Issue:11

Page Number:1163-1170

ISSN No.:0941-0643

Key Words:Scheduling; Deteriorating job; Controllable processing time; Polynomial time algorithm

Abstract: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.