SCHEDULING JOBS TO MINIMIZE TOTAL-COST

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29696

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29696

题名:	SCHEDULING JOBS TO MINIMIZE TOTAL-COST
作者:	CHEN,YL
贡献者:	資訊管理研究所
关键词:	ALGORITHMS
日期:	1994
上传时间:	2010-06-29 20:38:28 (UTC+8)
出版者:	中央大學
摘要:	The problem of preemptively scheduling a set of independent jobs with release times and deadlines to a set of parallel identical processors is a well-known scheduling problem. In this paper, we extend this famous problem by adding the consideration that the processing requirement of each job is not a fixed quantity but is a linear function of cost. We assume that the more cost we pay, the less processing requirement there is. Under this new assumption, our goal is to use the minimum cost to complete all jobs subject to their processing conditions. Two polynomial algorithms are developed for this new variant of scheduling problem.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	612	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing