Abstract
Maximal time lags between activities of a project play an important role in practice in addition to minimal ones. However, maximal time lags have been discussed very rarely in literature thus far. This paper shows how to model projects with minimal and maximal time lags by cyclic activity-on-node networks. As an important application, the production process for make-to-order production with limited resources is studied, which can be represented by a multi-project network where the individual operations of the jobs correspond to the nodes of the network. For different product structures, careful consideration is given to the modelling of a nondelay performance of overlapping operations by appropriately establishing minimal and maximal time lags.
Zusammenfassung
Zeitliche Maximalabstände zwischen den Vorgängen eines Projektes spielen neben zeitlichen Minimalabständen in der Praxis eine wesentliche Rolle. Bis heute sind zeitliche Maximalabstände jedoch in der Literatur kaum behandelt worden. Die vorliegende Arbeit zeigt, wie Projekte mit zeitlichen Minimal- und Maximalabständen als zyklische Vorgangsknotennetzwerke modelliert werden können. Als wichtige Anwendung wird der Produktionsprozeß in der Auftragsfertigung mit Kapazitätsbeschränkungen behandelt, der als Multi-Projekt-Netzwerk dargestellt werden kann, wobei die einzelnen Arbeitsgänge den Knoten des Netzwerks entsprechen. Für verschiedene Produktionsstrukturen wird die Modellierung einer unterbrechungsfreien offenen Fertigung durch die Bestimmung geeigneter zeitlicher Minimal- und Maximalabstände beschrieben.
Similar content being viewed by others
References
Askin RG, Standridge CR (1993) Modeling and Analysis of Manufacturing Systems. John Wiley, New York
Bartusch M (1983) Optimierung von Netzplänen mit Anordnungsbeziehungen bei knappen Ressourcen. Ph.D. Thesis. Technical University of Aachen
Bartusch M, Möhring RH, Radermacher FJ (1988) Scheduling Project Networks with Resource Constraints and Time Windows. Ann Oper Res 16:201–240
Brinkmann K, Neumann K (1996) Heuristic Procedures for Resource-Constrained Project Scheduling with Minimal and Maximal Time Lags: the Resource-Levelling and Minimum Project-Duration Problems. J Decision Systems 5:129–155
Chase RB, Aquilano NJ (1992) Production and Operations Management. 6th Ed. Irwin, Homewood
Christofides N, Alvarez-Valdes R, Tamarit JM (1987) Project Scheduling with Resource Constraints: A Branch and Bound Approach. Eur J Oper Res 29:262–273
Demeulemeester EL, Herroelen WS (1992) A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Mgmt Sci 38:1803–1818
Drexl A, Fleischmann B, Günther H-O, Stadtler H, Tempelmeier H (1994) Konzeptionelle Grundlagen kapazitätsorientierter PPS-Systeme. ZfbF 46:1022–1045
Elmaghraby SE (1977) Activity Networks. John Wiley, New York
Elmaghraby SE, Kamburowski J (1992) The Analyis of Activity Networks under Generalized Precedence Relations. Mgmt Sci 38:1245–1263
Evans JR, Anderson DR, Sweeny DJ, Williams TA (1990) Applied Productions & Operations Management. 3rd Ed. West Publishing, St. Paul
Garey MR, Johnson DS (1979) Computers and Intractability. W. H. Freedman, San Francisco
Günther H-O (1992) Netzplanorientierte Auftragsterminierung bei offener Fertigung. OR Spektrum 14:229–240
Heizer J, Render B (1993) Production and Operations Management. 3rd Ed. Allyn and Bacon, Boston
Nahmias S (1993) Production and Operations Analysis. 2nd Ed. Irwin, Homewood
Neumann K (1975) Operations-Research-Verfahren, Band III. Carl Hanser, München
Neumann K, Morlock M (1993) Operations Research. Carl Hanser, München
Neumann K, Schwindt C (1995) Projects with Minimal and Maximal Time Lags: Construction of Activity-on-Node Networks and Applications. Report WIOR-447. Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe
Neumann K, Zhan J (1995) Heuristics for the Minimum Project-Duration Problem with Minimal and Maximal Time Lags under Fixed Resource Constraints. J Intelligent Manufacturing 6:145–154
Roy B (1964) Les problèmes d'ordonnancement. Dunod, Paris
Stinson JP, Davis EW, Khumawala BM (1978) Multiple Resource-Constrained Scheduling Using Branch and Bound. AIIE Transactions 10:252–259
Talbot FB, Patterson JH (1978) An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems. Mgmt Sci 24:1163–1174
Wiest J, Levy F (1977) A Management Guide to PERT/CPM. Prentice Hall, Englewood Cliffs
Zhan J (1994) Heuristics for Scheduling Resource-Constrained Projects in MPM Networks. Eur J Oper Res 76:192–205
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Neumann, K., Schwindt, C. Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum 19, 205–217 (1997). https://doi.org/10.1007/BF01545589
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01545589
Key words
- Project planning and control
- resource-constrained project scheduling
- activity-on-node networks
- maximal time lags
- make-to-order production
- overlapping operations