Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Mathematics in Practice and Theory》 2018-18
Add to Favorite Get Latest Update

A New Proof of the Optimal Schedule

CUI Da-kai;LI Ru;LI Jing;Oxbridg College, Kunming University of Science and Technology;  
There are n pieces of jobs working on one machine, and their processing time and delivery time are known. By the literature on hand, we can obtain an optimal schedule which minimizing the number of tardy jobs. However, the proof of optimality is traditional.This paper gives a perfect and natural proof by introducing the principle of max-sum
【Fund】: 云南省教育厅科学研究基金项目(2015Y514)
【CateGory Index】: O223
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved