Inhaltsangabe
Excerpt from Decision Cpm, Network Reduction and Solution
The Decision cpm problem may be termed a discrete time - cost tradeoff problem generalized to include the possibility of interdependency con straints between the discrete job alternatives. It has been formulated as an integer programming problem and solved by integer programming and by heuristic techniques. This paper shows that a variant of the usual critical path method may be used to reduce the dcpm networks to an equiv alent network containing only decision nodes and maximal distances between them. This Operation, along with feasibility tests on the interdependency constraints, allows substantial elimination of the precedence constraints in the programming formulation. A branch and bound method is then devel Oped to solve the reduced problem.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Decision Cpm, Network Reduction and Solution (Classic...
Foto des Verkäufers
Decision Cpm, Network Reduction and Solution (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. Print on Demand. This revealing text offers a profound investigation into the Decision CPM problem. Through the development of novel techniques, the author effectively simplifies the problem, reducing redundant constraints and offering a path toward efficient solutions. By positioning the Decision CPM problem within the wider context of project planning and control, the book explores the complexities of managing projects with multiple interconnected decision points. It delves into the challenges of balancing project cost, duration, and deadline, while adhering to complex interdependencies. The author's meticulous approach to constraint elimination and lower bound calculation provides a valuable framework for understanding and solving these intricate problems. The insights gained through the book's methods enable project managers to make informed decisions, optimize resource allocation, and enhance overall project outcomes. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Bestandsnummer des Verkäufers 9781334017704_0
Neu kaufen
EUR 16,05
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Decision Cpm, Network Reduction and Solution Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781334017704
Beispielbild für diese ISBN
Decision Cpm, Network Reduction and Solution Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781334017704
Neu kaufen
EUR 24,92
EUR 3,86 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 15 verfügbar