点击次数：
论文类型：期刊论文
发表时间：2014-09-01
发表刊物：APPLIED MATHEMATICS AND COMPUTATION
收录刊物：SCIE、EI、Scopus
卷号：242
页面范围：309-314
ISSN号：0096-3003
关键字：Single-machine; Group scheduling; Bicriterion scheduling; Deteriorating jobs
摘要：This paper considers a group scheduling problem with two ordered criteria where both setup times and job-processing times are increasing functions of their starting times. It is assumed that the jobs be classified into several groups and the jobs of the same group have to be processed contiguously. We consider two objectives where the primary criterion is the total weighted completion time and the secondary criterion is the maximum cost. A polynomial time algorithm is presented to solve this bicriterion group scheduling problem with deteriorating setup times and job-processing times. This algorithm can also solve single-machine group scheduling problems with deteriorating setup times and job-processing times in several ordered maximum cost and arbitrary precedence. (C) 2014 Elsevier Inc. All rights reserved.