| 加工时间与位置有关的一类排序问题 |
| |
| 引用本文： | 余英.加工时间与位置有关的一类排序问题[J].凯里学院学报,2011,29(3). |
| |
| 作者姓名： | 余英 |
| |
| 作者单位： | 凯里学院,理学院,贵州,凯里,556011 |
| |
| 基金项目： | 凯里学院科研基金资助项目(Z1014),凯里学院重点学科建设项目(KZD2009001) |
| |
| 摘 要： | 研究单机具有递减率的加工时间成组排序问题,目标函数为超前有奖延迟受罚排序问题.研究了该问题的3种特殊情形,给出了相应的最优算法和计算复杂性的分析.
|
| 关 键 词： | 排序 单机 递减率 成组排序 超前 延误 |
A Scheduling Problem with Position Dependent Processing Time |
| |
| YU Ying.A Scheduling Problem with Position Dependent Processing Time[J].Journal of Southeast Guizhou National Teachers College,2011,29(3). |
| |
| Authors: | YU Ying |
| |
| Institution: | YU Ying(department of Science,Kaili University,Kaili,Guizhou,556011,China) |
| |
| Abstract: | This paper considers a group scheduling problem with learning effect on a single machine.The objective is to minimize the sum of earlyness award and tardiness penalty of all jobs.Optimal algorithm are provided and their complexity is also analyzed for three special circumstances. |
| |
| Keywords: | scheduling problem single machine decreasing rate group scheduling tardiness earliness |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
