| 关于共同宽容的单机交错排序问题 |
| |
| 引用本文： | 于彬,王广彬,许春明.关于共同宽容的单机交错排序问题[J].曲阜师范大学学报,2007,33(4):48-51. |
| |
| 作者姓名： | 于彬 王广彬 许春明 |
| |
| 作者单位： | [1]青岛科技大学数理学院,266061 [2]青岛大学数学学院,山东省青岛市266071 |
| |
| 摘 要： | 研究关于共同宽容交货期的单机排序问题.当共同的宽容区间大小给定，位置不固定问题时，该问题证明是NP-hard的，并给出了求解上述问题的动态规划算法.
|
| 关 键 词： | 排序 宽容区间 超前迟后 动态规划算法 |
| 文章编号： | 1001-5337（2007）04-0048-04 |
| 修稿时间： | 2006-12-21 |
An Interlacing Form Scheduling Problem with a Common Due Window |
| |
| YU Bin,WANG Guang-bin,XU Chun-ming.An Interlacing Form Scheduling Problem with a Common Due Window[J].Journal of Qufu Normal University(Natural Science),2007,33(4):48-51. |
| |
| Authors: | YU Bin WANG Guang-bin XU Chun-ming |
| |
| Institution: | 1.College of Mathematics and Physics, Qingdao University of Science and Technology, 266061; 2. College of Mathematics, Qingdao University, 266071, Qingdao, Shandong, PRC |
| |
| Abstract: | This paper focuses on the single machine scheduling problem with a common due window. It is proved NP-hard when the width of the due window is given and the site of the due window is free, this paper constructs the corresponding dynamic programming algorithm to slove it. |
| |
| Keywords: | scheduling common due window earliness-tardiness dynamic programming algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
