Show simple item record

dc.contributor.authorTaliaferro, Chris
dc.date.accessioned2013-12-26T21:43:47Z
dc.date.available2013-12-26T21:43:47Z
dc.date.issued2013-12-20
dc.identifier.urihttp://hdl.handle.net/1808/12598
dc.description.abstractVeritas Corporation is a thriving company in the fast-paced telecommunications industry. To keep up with the dynamic industry, a significant quantity of projects must be scheduled in a short time period without impacting each other. While Veritas succeeds in this, they do so at the cost of a significant number of management hours. The objective of this research is to produce a quantitative method to quickly and accurately produce an optimized schedule for the vast number of projects that Veritas implements. This was accomplished by making iterative binary integer linear programming models. The first model was to serve as a proof of concept and was conducted on a small market. After successful completion, the model was expanded to a larger market and verified. Outstanding results were seen in both iterations. By using historical data, it is evident that the optimized model outperformed traditional manual scheduling. The larger and more complicated the situation became the greater the improvement provided by the optimized model.
dc.language.isoen_US
dc.titleProject Schedule Optimization in a Telecommunications Environment
dc.typeProject
kusw.oastatusna
kusw.oapolicyThis item does not meet KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record