Scheduling jobs with a general learning effect model |
| |
Authors: | Ji-Bo Wang Jian-Jun Wang |
| |
Institution: | 1. School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. Faculty of Management and Economics, Dalian University of Technology, Dalian 116024, China |
| |
Abstract: | The paper deals with machine scheduling problems with a general learning effect. By the general learning effect, we mean that the actual processing time of a job is not only a non-increasing function of the total weighted normal processing times of the jobs already processed, but also a non-increasing function of the job’s position in the sequence, where the weight is a position-dependent weight. We show that even with the introduction of a general learning effect to job processing times, some single machine scheduling problems are still polynomially solvable under the proposed model. We also show that some special cases of the flow shop scheduling problems can be solved in polynomial time. |
| |
Keywords: | Scheduling Single machine Flow shop Learning effect |
本文献已被 ScienceDirect 等数据库收录! |
|