点击次数：
论文类型：期刊论文
发表时间：2018-09-01
发表刊物：COMPUTER JOURNAL
收录刊物：SCIE
卷号：61
期号：9
页面范围：1422-1428
ISSN号：0010-4620
关键字：scheduling; group technology; shortening job processing times; ready time
摘要：We investigate a group scheduling problem with shortening job processing times on a single machine in which the shortening is proportional-linear shortening and the setup time of a group is fixed. For the maximum completion time (i.e. the makespan) minimization problem with ready times, we show that the general case of the problem can be solved in polynomial time if the number of groups is a given constant. We also prove that some special cases of the problem can be optimally solved by a lower order algorithm respectively.