Single-machine scheduling problems with actual time-dependent and job-dependent learning effect |
| |
Authors: | Zhongyi Jiang Fangfang ChenHuiyan Kang |
| |
Institution: | School of Mathematics and Physics, Changzhou University, Changzhou, Jiangsu 213164, PR China |
| |
Abstract: | In this study, we introduce an actual time-dependent and job-dependent learning effect into single-machine scheduling problems. We show that the complexity results of the makespan minimization problem and the sum of weighted completion time minimization problem are all NP-hard. The complexity result of the maximum lateness minimization problem is NP-hard in the strong sense. We also provide three special cases which can be solved by polynomial time algorithms. |
| |
Keywords: | Scheduling Learning effect Actual time-dependent Job-dependent NP-hard |
本文献已被 ScienceDirect 等数据库收录! |