点击次数：
论文类型：期刊论文
发表时间：2013-02-01
发表刊物：APPLIED MATHEMATICAL MODELLING
收录刊物：SCIE、EI
卷号：37
期号：3
页面范围：649-658
ISSN号：0307-904X
关键字：Scheduling; Single-machine; Position-dependent processing times; Parallel chains; Series-parallel graph
摘要：In this paper we consider single-machine scheduling problems with position-dependent processing times, i.e., jobs whose processing times are an increasing or decreasing function of their positions in a processing sequence. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. It is shown that for the problems of minimization of the makespan polynomial algorithms exist. (C) 2012 Elsevier Inc. All rights reserved.