A Class of Single Machine Scheduling Problems with Variable Processing Time |
| |
Authors: | Zhou Hefang Zhou Xianwei |
| |
Affiliation: | School of Traffic and Transportation, Southwest Jiaotong University, |
| |
Abstract: | In this paper, single machine scheduling problems with variableprocessing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. |
| |
Keywords: | |
本文献已被 万方数据 等数据库收录! |
|