Resource-requirement minimization in relocation problems with precedence constraints

Bertrand M.T. Lin, Shian Shyong Tseng

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

The relocation problem is a generalized resourceconstrained job scheduling problem in the aspect that the amount of resources returned at the completion of a job is not necessarily equal to that demanded. In this paper, we propose fundamental properties of the basic relocation problem. Also, we consider a variant RPPC into which precedence constraints are introduced. We show that RPPC is NP-complete, even if the precedence graphs are bi-partite. Furthermore, efficient algorithms are presented to solve some polynomially solvable subproblems.

原文English
主出版物標題Proceedings - ICCI 1992
主出版物子標題4th International Conference on Computing and Information
編輯Peter E. Lauer, Anestis A. Toptsis, Waldemar W. Koczkodaj
發行者Institute of Electrical and Electronics Engineers Inc.
頁面26-29
頁數4
ISBN(電子)081862812X, 9780818628122
DOIs
出版狀態Published - 1 1月 1992
事件4th International Conference on Computing and Information, ICCI 1992 - Toronto, 加拿大
持續時間: 28 5月 199230 5月 1992

出版系列

名字Proceedings - ICCI 1992: 4th International Conference on Computing and Information

Conference

Conference4th International Conference on Computing and Information, ICCI 1992
國家/地區加拿大
城市Toronto
期間28/05/9230/05/92

指紋

深入研究「Resource-requirement minimization in relocation problems with precedence constraints」主題。共同形成了獨特的指紋。

引用此