Relocation problems of maximizing new capacities under a common due date

ASIA unversity > 資訊學院 > 行動商務與多媒體應用學系 > 期刊論文 > Item 310904400/4683

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/4683

题名:	Relocation problems of maximizing new capacities under a common due date
作者:	M. T. Lin;S. S. Tseng
贡献者:	Department of Information Science and Applications
日期:	1992
上传时间:	2009-11-30 08:03:06 (UTC+0)
出版者:	Asia University
摘要:	Given a set of h buildings to be torn down and rebuilt, each building Bi demands ni units of temporary vacancies for reconstruction (i.e. the reconstruction of Bi can be started only if there are at least ni temporary vacancies available) and returns a; units of vacancies when it is rebuilt. The reconstruction time of each building is assumed to be unitary. Under the initial provision of V0 units of vacancies and a specified due date d, ?Bi?Sai, where S is a feasible sequence such that \|S\| ? d, is the objective function to be maximized. We show that the problem is NP-complete
關聯:	International Journal of System Science 23(9):1433-1448
显示于类别:	[行動商務與多媒體應用學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	468	检视/开启
310904400-4683.doc		49Kb	Microsoft Word	356	检视/开启

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