【摘要】 本文证明了最短准备时间(SRT)排序使总的完工时间取得最小,并进一步分析了带有准备时间的带权误工工件数排序问题的一些性质.更多还原

【Abstract】 In this paper we prove that the shortest ready time (SRT) sequencing minimizes the total completion time, and analyse properties of the one-machine sequencing problem with ready time to minimize the weighted number of tardy jobs.更多还原