点击次数：
论文类型：期刊论文
发表时间：2014-05-15
发表刊物：APPLIED MATHEMATICS AND COMPUTATION
收录刊物：SCIE、EI、Scopus
卷号：234
页面范围：286-292
ISSN号：0096-3003
关键字：Scheduling; Single machine; Time-dependent processing times; Group technology; Ready times
摘要：In this paper we investigate a single machine scheduling problem with decreasing timedependent processing times and group technology assumption. By the decreasing timedependent processing times and group technology assumption, we mean that the group setup times and job processing times are both decreasing linear functions of their starting times. We want to minimize the makespan subject to release dates. We show that the problem can be solved in polynomial time. (C) 2014 Published by Elsevier Inc.