On the Project Scheduling under Resource Constraints

具資源限制的專案排程問題

施能輝(Neng-Hui Shih)

《工業工程學刊》 23卷6期 (2006/11) Pp. 494-500

https://doi.org/10.29977/JCIIE.200611.0007

摘要

本論文探討具資源限制的專案排程問題。特別是，本論文針對專案所包含的各活動具有隨機的工作時間時，專案排程所具備的一些理論特性進行分析與討論。本論文先定義何謂解決資源衝突的資源分配策略。然後將此策略分解成環節相扣的小戰術。每個小戰術代表解決某種資源衝突的方法。本論文同時解釋了有關此類型的資源分配策略之一些特性。本論文也討論了這一類型的資源分配策略與文獻裏的先擇策略(preselective strategy)的關係。同時有關此類型資源分配策略的動態性質也條列在本論文中。最後，本論文利用所提的資源分配策略為出發點，建議了幾種貪婪法(greedy method)來分配資源以便縮短整個專案的完工時間。

關鍵字

專案排程 ； 資源限制

並列摘要

This paper delves into the theoretic properties of the project scheduling problem that with stochastic durations and under resource constraints. This research begins with an exploration about how a resource conflict occurs and then uses a new definition of a strategy to solve the resource conflict. The strategy is decomposed into several tactics. Each tactic is associated with a solution of a resource conflict. Properties of the strategy are demonstrated. The relation between the preselective strategy and the proposed method is clarified. The dynamic properties of resource conflicts and the strategies are also discussed in this paper. Finally, this paper proposes a greedy method for the strategy of the resource allocation to reduce the completion time of the project.

並列關鍵字

Project scheduling ； resource constraint

參考文獻

Brucker, P.,A. Drexl,R. Mohring,K. Neumann,E. Pesch(1999).Resource-constrained project scheduling: Notation, classification, models, and methods.European Journal of Operational Research.112,3-41.

Graham R(1966).Bounds on Multiprocessing timing anomalies.Bell System Technical Journal.45,1563-1581.

Igelmund, G.,F. J. Radermacher(1983).Preselective strategies for the optimization of stochastic project networks under resource constraints.(Networks).

Icmeli, O..,S.S. Erenguc,C.J. Zappe(1993).Project scheduling problems: A survey.International Journal of Operational ＆ Production Management.13(11),80-91.

Mohring, R. H.(2000).Scheduling under uncertainty: Optimization against a randomization adversary.(Inn proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems).