標題: GENERATING THE BEST K-SEQUENCES IN RELOCATION PROBLEMS
作者: LIN, BMT
TSENG, SS
資訊科學與工程研究所
Institute of Computer Science and Engineering
關鍵字: PLANNING;SCHEDULING;CONSTRUCTION;OPTIMIZATION
公開日期: 27-八月-1993
摘要: 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.
URI: http://hdl.handle.net/11536/14260
ISSN: 0377-2217
期刊: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume: 69
Issue: 1
起始頁: 131
結束頁: 137
顯示於類別:期刊論文