Several single-machine scheduling problems with general learning effects |
| |
Authors: | Yuan-Yuan Lu Cai-Min Wei Ji-Bo Wang |
| |
Institution: | 1. College of Mathematics, Jilin Normal University, Siping, Jilin 136000, China;2. Department of Mathematics, Shantou University, Shantou, Guangdong 515063, China;3. School of Science, Shenyang Aerospace University, Shenyang, Liaoning 110136, China |
| |
Abstract: | In this paper we consider several single-machine scheduling problems with general learning effects. By general learning effects, we mean that the processing time of a job depends not only on its scheduled position, but also on the total normal processing time of the jobs already processed. We show that the scheduling problems of minimization of the makespan, the total completion time and the sum of the θ th (θ?0) power of job completion times can be solved in polynomial time under the proposed models. We also prove that some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time. |
| |
Keywords: | Scheduling Single-machine Learning effect Polynomial time algorithm |
本文献已被 ScienceDirect 等数据库收录! |
|