Project Scheduling with Time Windows and Scarce Resources

Neumann, Klaus; Schwindt, Christoph; Zimmermann, Jürgen

doi:10.1007/978-3-662-22341-3

Cited by 73 publications

(66 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To this end, we briefly touch the concept of so-called strict orders on the activity set V that is well known from literature (cf., e.g., Neumann et al 2003) However, since a solution for Problem (P) consists of a schedule S as well as of a mode assignment M, order polytopes are not sufficient to describe the solution space of the underlying scheduling problem adequately. In order to extend the concept of order polytopes by considering also mode assignments, we introduce the term of a mode-set-vector M := (M i ) i∈V , which is a vector of mode sets M i for the individual activities i ∈ V .…”

Section: Proposition 3 Schedule S Is Inventory Feasible If and Only Imentioning

confidence: 99%

“…A more detailed description of these terms and concepts is, e.g., given by Demeulemeester and Herroelen (2002) as well as Neumann et al (2003).…”

Section: Problem Description and Modelmentioning

confidence: 99%

“…To represent limited storage facilities, we make use of the concept of so-called cumulative resources and establish a cumulative resource which is depleted and replenished during a dismantling project (cf. Neumann et al 2003). The availability of cumulative resource l ∈ R γ at a given point in time t results from all positive and negative changes in the inventory that have occurred by time t .…”

Section: Definition 3 (Es-and Ls-schedule)mentioning

confidence: 99%

“…This means that there can be solutions that belong to more than just one mode polytope. To reduce the resulting redundancy, we apply several dominance criteria for enumeration nodes that have been devised by De Reyck and Herroelen (1998), Neumann et al (2003), and Schwindt (1998a. According to these rules, we can exclude enumeration node ( is not a successor of (O , M ).…”

Section: A Branch-and-bound Algorithmmentioning

confidence: 99%

“…Subsequently, we introduce briefly how we use the concept of forbidden sets in the context of Problem (P) where we distinguish between forbidden sets for renewable and for cumulative resources. A comprehensive description of the concept of forbidden sets for both, renewable and cumulative resources, can be found in Neumann et al (2003).…”

Section: Corollary 1 Problem (P) Is Np-hard In the Strong Sensementioning

confidence: 99%

See 4 more Smart Citations

Dismantling of nuclear power plants at optimal NPV

Bartels¹,

Gather²,

Zimmermann

2010

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

Today, worldwide far more than 100 nuclear power plants, which have been decommissioned in the recent years, are waiting for their complete dismantling. Since the dismantling of a single reactor causes costs of up to one billion Euros and lasts up to 15 years, the elaboration of a scheduling approach helping to optimize the net present value of a dismantling project seems to be worthwhile. In this paper we present a resource-constrained project scheduling approach optimizing the total discounted disbursements of dismantling a nuclear power plant. For the corresponding NP-hard optimization problem, we introduce an appropriate project scheduling model with minimum and maximum time lags, renewable and cumulative resources as well as multiple execution modes. To solve this model, we introduce a relaxation-based enumeration approach that delivers optimal solutions for problem instances containing up to 50 activities.

show abstract

Section: Proposition 3 Schedule S Is Inventory Feasible If and Only Imentioning

confidence: 99%

“…A more detailed description of these terms and concepts is, e.g., given by Demeulemeester and Herroelen (2002) as well as Neumann et al (2003).…”

Section: Problem Description and Modelmentioning

confidence: 99%

Section: Definition 3 (Es-and Ls-schedule)mentioning

confidence: 99%

Section: A Branch-and-bound Algorithmmentioning

confidence: 99%

Section: Corollary 1 Problem (P) Is Np-hard In the Strong Sensementioning

confidence: 99%

See 3 more Smart Citations

Dismantling of nuclear power plants at optimal NPV

Bartels¹,

Gather²,

Zimmermann

2010

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

show abstract

A new formulation of the resource‐unconstrained project scheduling problem with generalized precedence relations to minimize the completion time

Bianco

Caramia

2010

Networks

View full text Add to dashboard Cite

Concentration inequalities for nonlinear matroid intersection

Makarychev

Schudy

Sviridenko

2013

Random Struct. Alg.

View full text Add to dashboard Cite

ABSTRACT:In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that has numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree, Unrelated Parallel Machines Scheduling and scheduling with time windows and nonlinear objectives. We also show applications related to Constraint Satisfaction and dense polynomial optimization.

show abstract

Project Scheduling with Time Windows and Scarce Resources

Abstract: Die Deutsche Bibliothek-CIP-Einheitsaufnahme Neumann, Klaus: Project scheduling with time windows and scarce resources: temporal and resource constrained project scheduling with regular and nonregular objective functions I Klaus Neumann; Christoph Schwindt; liirgen Zimmermann.

Cited by 73 publications

References 0 publications

Dismantling of nuclear power plants at optimal NPV

Dismantling of nuclear power plants at optimal NPV

A new formulation of the resource‐unconstrained project scheduling problem with generalized precedence relations to minimize the completion time

Concentration inequalities for nonlinear matroid intersection

Contact Info

Product

Resources

About