期刊
INFORMATION SCIENCES
卷 251, 期 -, 页码 164-181出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2013.06.035
关键词
Scheduling; Due date assignment; Past-sequence-dependent delivery time; Position-dependent learning effect
资金
- National Natural Science Foundation of China [61025018]
- National Key Basic Research and Development Program of China [2009CB320602]
- Tian Yuan Special Funds of the National Natural Science Foundation of China [11226264]
- Natural Science Foundation of Jiangxi, China [20132BAB201010]
- Science Foundation of Education Committee of Jiangxi, China [GJJ13458]
- National Science Council (NSC) of Taiwan [NSC 102-2410-H-035-034]
This paper considers single-machine scheduling problems with simultaneous consideration of due date assignment, past-sequence-dependent (p-s-d) delivery times, and position-dependent learning effects. By p-s-d delivery times, we mean that the delivery time of a job is proportional to the job's waiting time. Specifically, we study four variants of the problem: (i) the variant of total earliness and tardiness with common due date assignment (referred to as TETDC), (ii) the variant of total earliness and weighted number of tardy jobs with CON due date assignment (referred to as TEWNTDC), (iii) the variant of total earliness and weighted number of tardy jobs with slack due date assignment (referred to as TEWNTDS), and (iv) the variant of weighted number of tardy jobs with different due date assignment (referred to as WNTDD). We derive the structural properties of the optimal schedules and show that the variants TETDC, TEWNTDC and TEWNTDS are all polynomially solvable. Although the complexity status of the variant WNTDD is still open, we show that two special cases of it are polynomially solvable. (c) 2013 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据