نتایج جستجو برای: project critical path problem

تعداد نتایج: 1630087  

Abdollah Aghaie, Hadi Mokhtari, M. Reza Peyghami,

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

Journal: :Aircraft Engineering and Aerospace Technology 2017

2015
Pardha Saradhi N. Ravi Shankar

In the present paper, Characteristics of fuzzy project network using statistical data are discussed in detail in order to calculate the fuzzy critical path, fuzzy earliest times, fuzzy latest times and fuzzy total float. Fuzzy number as fuzzy activity time is constructed using interval estimate by calculating mean, variance and standard error. A new ranking function is used to discriminate the ...

2011
N. Ravi Shankar Pardha Saradhi

Critical Path method (CPM) is widely used in project scheduling and controlling. In conventional project scheduling problem, the crisp numbers are used for the activity times. But in reality, in an imprecise and uncertain environment, it is an unrealistic assumption. To represent the uncertainty involved we have considered the interval-valued numbers to represent the activity times. In this pap...

In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...

2011
P. Phani Bushan Rao Ravi Shankar

The Critical Path Method (CPM) is useful for planning and control of complex projects. The CPM identifies the critical activities in the critical path of an activity network. The successful implementation of CPM requires the availability of clear determined time duration for each activity. However, in practical situations this requirement is usually hard to fulfill since many of activities will...

In a network that has the potential to block some paths, choosing a reliable path, so that its survival probability is high, is an important and practical issue. The importance of this issue is very considerable in critical situations such as natural disasters, floods and earthquakes. In the case of the reliable path, survival or blocking of each arc on a network in critical situations is an un...

1996
C. L. McCreary M. A. Cleveland A. A. Khan

Multi-processor scheduling is an NP-hard problem, so heuristic solutions must be found. Several critical path heuristics have been proposed, but these must be empirically tested to see if their solutions are adequate. This paper examines the performance of four critical path heuristics and nds that they are unable to perform well on the types of graphs which are likely to be created by compiler...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->