Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1705443 | Applied Mathematical Modelling | 2013 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Ji-Bo Wang, Jian-Jun Wang,