Ein verfahren für die exakte behandlung von problemen der ablaufplanung mit hilfsmittelbeschränkungen1
作者:
Klaus Hofstedt,
期刊:
Mathematische Operationsforschung und Statistik
(Taylor Available online 1972)
卷期:
Volume 3,
issue 4
页码: 239-253
ISSN:0047-6277
年代: 1972
DOI:10.1080/02331887208801080
出版商: Akademie-Verlag
数据来源: Taylor
摘要:
The point of departure of this paper is the planning and scheduling of a project by using the critical path method for a block diagram. The network is represented as a graph, and the task of scheduling the time is formulatod as a potential problem. Considering available resource levels in realizing a project, the graph is extended and several constraints are formed for a flow in the extended graph. These constraints and the potential problem lead to an integer linear programming problem with the object of minimizing the time. Finally, by using an example the structure of the linear programming problem is displayed and an algorithm for solving the problem is mentioned.
点击下载:
PDF (733KB)
返 回