Single-machine scheduling with precedence constraints and position-dependent processing times |
| |
| Authors: | Ji-Bo Wang Jian-Jun Wang |
| |
| Affiliation: | 1. School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. Faculty of Management and Economics, Dalian University of Technology, Dalian 116024, China |
| |
| 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. |
| |
| Keywords: | Scheduling Single-machine Position-dependent processing times Parallel chains Series&ndash parallel graph |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
