Overview

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.

Full Product Details

9781334017704

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available