期刊
APPLIED MATHEMATICAL MODELLING
卷 37, 期 4, 页码 2364-2373出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2012.05.029
关键词
Scheduling; Single machine; Flow shop; Learning effect
资金
- National Natural Science Foundation of China [11001181, 70902033]
- Program for Liaoning Excellent Talents in University [LJQ2011014]
- Fundamental Research Funds for the Central Universities [DUT11SX10]
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. (C) 2012 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据