Application Cutting Plane Method for Stochastic Time Cost Trade off Problem in Project PERT Type Networks

Publish Year: 1387
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,407

This Paper With 22 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

IIEC06_041

تاریخ نمایه سازی: 8 مهر 1387

Abstract:

We develop a Confidence Level (C.L) based approach for Stochastic Time-Cost Trade off Problem (STCTP) in a PERT type networks, where activities are subjected to linear cost functions and assumed that exponentially distributed. The objective of proposed method is improving the probability of project completion time in a prespecified due date to a predefined probability (C.L). For this purpose, we construct a non-linear convex program with decision variables of activity mean times. The objective of the described model is minimization of direct costs of project compression/ crashing. The proposed model has effective managerial advantages for prevention of project tardiness. Project planners can decrease potential risk of real environment by increasing Confidence Level of project completion to a reasonable value (predefined). For solving formulation of constructed model, we present a well-established hybrid approach which uses mixed simulation, mathematics (Cutting Plane Method) and heuristic. This hybrid approach solves an approximated linear programming that obtained by using cutting planes, for path with maximum Path Criticality Index (Calculated by using simulation results), in each iteration. In the last step, the approach uses a heuristic algorithm for optimal elimination of Cutting Plane approximation. Finally for demonstration of model ability, two illustrative examples are discussed

Authors

Hadi Mokhtari

Industrial Engineering Department, KN Toosi University of Technology, Tehran, Iran

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • Fulkerson DR. A network flow computation for project cost curve. ...
  • Cohen I, Golany B, Shtub A. The Stochastic Time-Cost Tradeoff ...
  • Pulat PS, Horn SJ. Time-Re SOurce Tradeoff Problem. IEEE transactions ...
  • Crowston W, Thompson GL. Decision CPM: A method for S ...
  • Robinson DR. A dynamic programming solution to cost-time tradeoff for ...
  • Harvey, R.T. & Patterson, J.H. An implicit enumeration algorithm for ...
  • D _ meulemeester B, Elmaghraby SE, Herroelen W. Optimal procedures ...
  • Demeulemee ster B, De Reyck B, Foubert B, Herroelen W, ...
  • Tavares LV. A Multi Stage Non- deterministic Model for a ...
  • Vanhoucke M, Debels D. The discrete time/cost trade-off problem: extensions ...
  • Lamberson LR, Hocking RR. Optimum time compression in project scheduling. ...
  • Berman EB. Resource allocation in PERT network under continuous time-cost ...
  • Falk J, Horowitz J. Critical path problem with concave cost-time ...
  • Kuyumcu, A. & Garcia-diaz, A. A decompo sition Approach to ...
  • Vrat P, Kriengkrairut _ A goal programming model for project ...
  • Kelley JE. Critical-path planning and scheduling: Mathematical basis. Operations Research ...
  • Deckro R F, Hebert J E, Verdini WA, Grimsurd PH, ...
  • Leu S, Chen A, Yang C. A GA-based fuzzy optimal ...
  • Burns SA, Liu L, Weifeng _ The Lp/Ip hybrid method ...
  • Chua, D.K.H. Chan, W. T. & Govindan, K. A time ...
  • B uddhakul somsiri J, Kim D. Properties of multi-mode resource- ...
  • GOY AL SK. A Note on "A Simple CPM Time-Cost ...
  • Siemens N. A Simple CPM Time-Cost Tradeoff Algorithm. Management Science ...
  • Herroelen W, Leus R. Project scheduling under uncertainty: Survey and ...
  • Bowman RA. Stochastic gradient-bas ed time-cost tradeoffs in PERT networks ...
  • Abbasi G, Mukattash AM. Crashing PERT networks using mathematical programming ...
  • Arisawa S, Elmaghraby SE. Optimal Time-Cost Trade-Offs in GERT Netvorks. ...
  • Golenko -Ginzberg D, Gonik A. A heuristic for network project ...
  • Sunde L, Lichtenberg S. Net-present value cost/time trade off. International ...
  • Foldes S, Soumis F. PERT and crashing revisited: Mathematical generalization. ...
  • Gutjahr WJ, Strauss C, Wagner E. A Stochastic Branch- and-Bound ...
  • Bergman R. A heuristic procedure for solving the dynamic probabilistic ...
  • Mitchell G, Klastorin T. An effective methodology for the stochastic ...
  • Godinho PC, Costa JP. A stochastic multimode model for time ...
  • Haga W, Marold K. A Simulation Approach to the PERT/CPM ...
  • Haga W, Marold K. Monitoring and Control of PERT Networks. ...
  • Yau C, Ritche E. Project compression: A method for speeding ...
  • Feng CW, Liu L, Burns SA. Stochastic construction Time-Cost trade ...
  • Azaron A, Perkgoz C, Sakawa M. A genetic algorithm Approach ...
  • Azaron A, Katagiri H, Sakawa M, Kato K, Memariani A. ...
  • Azaron A, T av akkol i-Moghaddam R. A multi objective ...
  • Azaron A, Katagiri H, Sakawa M. Time-cost trade-off via optimal ...
  • Eshtehardian E, Afshar A, Abbasnia R. Time-cost optimization: using GA ...
  • Kelly JE. The cutting plane method for solving convex prograns. ...
  • Martin J. Distribution of the time through a directed, acyclic ...
  • Van Slyke RM. Monte Carlo methods and the PERT problem. ...
  • Signal CE, Pritsker AAB, Solberg J. The use of cutsets ...
  • Bowman RA. Efficient Estimation of Arc Criticalities _ Stochastic Activity ...
  • Soroush HM. The Most Critical Path _ a PERT Network. ...
  • Fatemi Ghomi SMT, Teimouri E. Path critical index and activity ...
  • نمایش کامل مراجع