点击次数：
论文类型：期刊论文
发表时间：2015-10-01
发表刊物：ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
收录刊物：SCIE、EI、SSCI、Scopus
卷号：32
期号：5
ISSN号：0217-5959
关键字：Scheduling; learning effect; deteriorating jobs; resource allocation; single-machine
摘要：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.