| 具有窗口交货期的单机E/T调度问题 |
| |
| 引用本文： | 贾春福,孙旭.具有窗口交货期的单机E/T调度问题[J].南开大学学报,2004,37(4):48-53. |
| |
| 作者姓名： | 贾春福 孙旭 |
| |
| 作者单位： | 南开大学信息技术科学学院，天津300071 |
| |
| 摘 要： | 工件完成时间与交货期差的绝对值加权和最小化单机调度是典型的E／T(Earliness／Tardiness)的调度模型，是NP-hard问题．然而，当工件权值与加工时间成正比时，LPT(Largest Processing Time)工件调度最优．本讨论了上述问题具有窗口交货期且工件权值与加工时间成正比的情形，结果表明LPT工件调度仍然最优．
|
| 关 键 词： | 单机调度 窗口交货期 E／T（Earliness／Tardiness） 正比权值 |
| 文章编号： | 0465-7942(2004)04-0048-06 |
| 修稿时间： | 2002年4月17日 |
SINGLE MACHINE E/T SCHEDULING WITH WINDOW DUE DATE |
| |
| JIA Chunfu SUN Xu.SINGLE MACHINE E/T SCHEDULING WITH WINDOW DUE DATE[J].Acta Scientiarum Naturalium University Nankaiensis,2004,37(4):48-53. |
| |
| Authors: | JIA Chunfu SUN Xu |
| |
| Abstract: | The single machine scheduling problem to minimize total weighted deviations of completion times from a common due date is a typical E/T (Earliness/Tardiness) scheduling model. It is NP-hard. However, the LPT(Largest Processing Time) job schedule is optimal when the job weights are proportional to processing times. In this paper, the case with window due date and proportional weights of this problem is discussed, it is shown that LPT job schedule is also optimal.$$$$ |
| |
| Keywords: | single machine scheduling window due date E/T(Earliness/Tardiness) proportional weight |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
