GENERATING THE BEST K-SEQUENCES IN RELOCATION PROBLEMS

dc.citation.epage	137	en_US
dc.citation.issue	1	en_US
dc.citation.spage	131	en_US
dc.citation.volume	69	en_US
dc.citation.woscount	5
dc.contributor.author	LIN, BMT	en_US
dc.contributor.author	TSENG, SS	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.date.accessioned	2014-12-08T15:20:06Z
dc.date.available	2014-12-08T15:20:06Z
dc.date.issued	1993-08-27	en_US
dc.description.abstract	There is a set J of h jobs to be processed. For every i, job J(i) demands n(i) units of resources and returns a(i) units after completion. The problem is to find the best K schedules whose resource requirements are minimum among all h! ones. In this paper, we present some important structural properties and then propose an O(h log h + hK log K) time algorithm, which runs in polynomial time if K is fixed.	en_US
dc.identifier.issn	0377-2217	en_US
dc.identifier.journal	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/14260
dc.identifier.wosnumber	WOS:A1993LT82600014
dc.language.iso	en_US	en_US
dc.subject	PLANNING	en_US
dc.subject	SCHEDULING	en_US
dc.subject	CONSTRUCTION	en_US
dc.subject	OPTIMIZATION	en_US
dc.title	GENERATING THE BEST K-SEQUENCES IN RELOCATION PROBLEMS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1