Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Chongqing Normal University(Natural Science)》 2018-04
Add to Favorite Get Latest Update

Two-Agent Scheduling Problem about Tardiness on a Single Machine

ZHANG Xingong;CHEN Qiuhong;WANG Xiangbing;School of Mathematics Sciences,Chongqing Normal University;School of Economics & Management,Guizhou University of Engineering Science;  
[Purposes]Two-agent scheduling problem about tardiness on a single machine is considered here.[Methods]The objective of the first agent is total tardiness or the maximum tardiness with agreeable due dates,while the second agent considers the number of tardy job with preemptive or the maximum coast function.The goal is to find an optimal scheduling in combination with the Lawler algorithm or the EDD rule in the case of model determination that minimize the objective of the first agent while keeping the second agent schedule all its job satisfy the second agent feasible.[Findings]The optimal scheduling is obtained to minimize the objective function of the first agent under the condition that the optimal schedule rules above is limited.[Conclusions]A dynamic programming algorithm is presented for the total tardiness scheduling problem and the maximum tardiness time complexity proofs are given here.
【Fund】: 国家自然科学基金项目(No.11571321;No.71561007);; 贵州省教育厅人文社科基金重点项目(No.14ZD007)
【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