Multi-resource allocation in stochastic project scheduling

Wiesemann, Wolfram; Kühn, Daniel; Rustem, Berç

doi:10.1007/s10479-008-0486-z

Cited by 19 publications

(12 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In non-critical activity (1,1), (2,3), (3,3) and (3,5), production process (3,3) must be performed directly after (3,1) without postponing according to the process requirement. Thus, adjustment of production process (1,1), (2,3) and (3,3) is discussed here.…”

Section: Figure 1 Plan Network Diagram With Resource Allocationmentioning

confidence: 99%

“…An active resource allocation method that the level of actual resource mobilization can be changed by the construction period is demonstrated in [2]. A resource allocation model for project scheduling is proposed in [3]. To solve resource allocation project scheduling problem and resource leveling problem at the same time, two new metaheuristic algorithms are utilized in [4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimization Model of Balanced Resource Allocation in Construction Project Group

Chang¹,

Qi²,

Song³

2016

Proceedings of the 2016 International Forum on Energy, Environment and Sustainable Development

View full text Add to dashboard Cite

Abstract. In construction project group, the construction process is numerous, the resources required are multifarious, the resources allocation is difficult, and it is easy to appear resource allocation imbalance within a certain period of time. To implement the balance allocation of resources among varied projects, the optimization allocation model of resource equilibrium in project group is established. In constraints, construction process in each project should obey logic order; supply quantity of each resource per day should be within its lower limit and upper limit scope. A heuristic algorithm is proposed to solve above model so as to realize the balanced allocation of resources. Through the analysis of examples in application, its validity is validated, and it will provide reference for practical resource imbalance problems in engineering project group.

show abstract

Section: Figure 1 Plan Network Diagram With Resource Allocationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Optimization Model of Balanced Resource Allocation in Construction Project Group

Chang¹,

Qi²,

Song³

2016

Proceedings of the 2016 International Forum on Energy, Environment and Sustainable Development

View full text Add to dashboard Cite

show abstract

“…The work content of a task can be understood as a measure of the effort (e.g., manhours) required for its completion (Wiesemann et al 2012). This convention leads to an endogenization of the task durations, which not only depend on their exogenous work contents but also on the resource allocation chosen by the follower.…”

Section: Crashing With Renewable Resourcesmentioning

confidence: 99%

Interdiction Games on Markovian PERT Networks

2015

Self Cite

View full text Add to dashboard Cite

I n a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, and an interdictor endeavors to maximize the project duration by delaying some of the project tasks. We formulate static and dynamic versions of the interdictor's decision problem where the interdiction plan is either precommitted or adapts to new information revealed over time, respectively. The static model gives rise to a stochastic program, whereas the dynamic model is formalized as a multiple optimal stopping problem in continuous time and with decision-dependent information. Under a memoryless probabilistic model for the task durations, we prove that the static model reduces to a mixed-integer linear program, whereas the dynamic model reduces to a finite Markov decision process in discrete time that can be solved via efficient value iteration. We then generalize the dynamic model to account for uncertainty in the outcomes of the interdiction actions. We also discuss a crashing game where the proliferator can use limited resources to expedite tasks so as to counterbalance the interdictor's efforts. The resulting problem can be formulated as a robust Markov decision process.

show abstract

“…Instead, we eliminate the inner minimisation in RT N by enumerating the task paths of the network. A solution scheme based on path enumeration has recently been proposed in project scheduling under a probabilistic uncertainty model [34]. In this section, we present a path-wise reformulation of RT N and argue that it is unsuited for direct solution.…”

Section: Path-wise Problem Formulationmentioning

confidence: 99%

Robust resource allocations in temporal networks

2011

Self Cite

View full text Add to dashboard Cite

Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations. In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem of selecting an 'optimal' resource allocation, where optimality is measured by network characteristics such as the makespan (i.e., the time required to complete all tasks). In this paper, we study a robust resource allocation problem where the functional relationship between task durations and resource assignments is uncertain, and the goal is to minimise the worst-case makespan. We show that this problem is generically N P-hard. We then develop convergent bounds for the optimal objective value, as well as feasible allocations whose objective values are bracketed by these bounds. Numerical results provide empirical support for the proposed method.

show abstract

Multi-resource allocation in stochastic project scheduling

Cited by 19 publications

References 38 publications

Optimization Model of Balanced Resource Allocation in Construction Project Group

Optimization Model of Balanced Resource Allocation in Construction Project Group

Interdiction Games on Markovian PERT Networks

Robust resource allocations in temporal networks

Contact Info

Product

Resources

About