Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect |
| |
Authors: | Yunqiang Yin Dehua Xu Jiayin Wang |
| |
Affiliation: | 1. College of Mathematics and Information Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China;2. School of Mathematical Sciences, Beijing Normal University, Key Laboratory of Mathematics and Complex System, Ministry of Education, Beijing 100875, China |
| |
Abstract: | In this paper, we bring into the scheduling field a general learning effect model where the actual processing time of a job is not only a general function of the total actual processing times of the jobs already processed, but also a general function of the job’s scheduled position. We show that the makespan minimization problem and the sum of the kth power of completion times minimization problem can be solved in polynomial time, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions. |
| |
Keywords: | Scheduling Learning effect Single-machine |
本文献已被 ScienceDirect 等数据库收录! |
|