An application of convex programming to construction scheduling McCann, Michael
dc.contributor.department Industrial and Manufacturing Systems Engineering 2018-08-15T06:37:00.000 2020-07-02T06:04:16Z 2020-07-02T06:04:16Z Wed Jan 01 00:00:00 UTC 1986 1986
dc.description.abstract <p>Recent advances in micro-computer technology have made possible the practical application of convex programming algorithms such as used in the simplex methods, the out-of-kilter method, Beale's method, the supporting plane methods, the ellipsoidal methods, Gomory's method, and the branch and bound methods to the optimization of construction scheduling problems as defined by the critical path method. These algorithms have been adapted and coded with the IBM BASIC computer language for the solution of problems involving the minimization of schedule overall costs, total man count, and direct supervision costs to demonstrate the feasibility and practicality of the methods.</p>
dc.format.mimetype application/pdf
dc.identifier archive/
dc.identifier.articleid 9019
dc.identifier.contextkey 6328622
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath rtd/8020
dc.language.iso en
dc.source.bitstream archive/|||Sat Jan 15 02:05:14 UTC 2022
dc.subject.disciplines Industrial Engineering
dc.subject.keywords Industrial engineering
dc.subject.keywords Engineering valuation
dc.title An application of convex programming to construction scheduling
dc.type article
dc.type.genre dissertation
dspace.entity.type Publication
relation.isOrgUnitOfPublication 51d8b1a0-5b93-4ee8-990a-a0e04d3501b1 dissertation Doctor of Philosophy
Original bundle
Now showing 1 - 1 of 1
7.63 MB
Adobe Portable Document Format