点击次数：
论文类型：期刊论文
发表时间：2014-08-10
发表刊物：INFORMATION SCIENCES
收录刊物：SCIE、EI、Scopus
卷号：275
页面范围：226-231
ISSN号：0020-0255
关键字：Scheduling; Single machine; Start time dependent processing time; Group technology; Ready time
摘要：In this paper we investigate a single machine scheduling problem with time dependent processing times and group technology (GT) assumption. By time dependent processing times and group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., group setup times and job processing times are both described by function which is proportional to a linear function of time. We attempt to minimize the makespan with ready times of the jobs. We show that the problem can be solved in polynomial time when start time dependent processing times and group technology are considered simultaneously. (C) 2014 Elsevier Inc. All rights reserved.