Abstract
Nearly all recently published papers about automatical network construction by computer and plotter deal with activity-edgenetworks. We discuss several ways to construct activity-are-networks, which differ with regard to the arrangement of dummy jobs, and give a survey of already known methods. As main result, we derive an algorithm for the automatical plotting of small activity-arc-networks. Becallse of the reduction theorems for ordered sets it can also be applied to large reducible networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Physica-Verlag, Rudolf Liebing KG, Würzburg
About this paper
Cite this paper
Möhring, R., Schumacher, W. (1976). Ein Algorithmus zur automatisierten Darstellung von Vorgangspfeilnetzplänen. In: Kohlas, J., Seifert, O., Stähly, P., Zimmermann, HJ. (eds) Proceedings in Operations Research 5. Vorträge der Jahrestagung 1975 DGOR / SVOR, vol 1975. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-99748-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-99748-8_41
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0165-1
Online ISBN: 978-3-642-99748-8
eBook Packages: Springer Book Archive