Project scheduling with inventory constraints

Neumann, Klaus; Schwindt, Christoph

doi:10.1007/s001860200251

Cited by 85 publications

(63 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Cumulative resources (CR) have a variable availability, which is not necessarily the same after the completion of an activity (Neumann and Schwindt, 2002). Examples of a cumulative resource are inventory and capital.…”

Section: Problem Definitionmentioning

confidence: 99%

Capital- and resource-constrained project scheduling with net present value optimization

Leyman

Vanhoucke

2017

European Journal of Operational Research

View full text Add to dashboard Cite

In this paper, we study the capital-constrained project scheduling problem with discounted cash flows (CCPSPDC) and the capital-and resource-constrained project scheduling problem with discounted cash flows (CRCPSPDC). The objective of both problems is to maximize the project net present value (NPV), based on three cash flow models. Both problems include capital constraints, which force the project to always have a positive cash balance. Hence, it is crucial to schedule activities in such an order that sufficient capital is available.The contribution of this paper is threefold. First, we propose three distinct cash flow models, which affect the capital availability during the project. Second, we introduce two new schedulers to improve capital feasibility, one for the CCPSPDC and one for the CRCPSPDC. The schedulers focus on delaying sets of activities, which cause cash outflows to be received at later time instances, in order to reduce capital shortages. Both schedulers are implemented as part of three metaheuristics from literature, in order to compare the metaheuristics' performance. Two penalty functions have been included, one to improve capital feasibility and another to improve deadline feasibility. Third, the proposed procedure has been tested on a large dataset and the added value of the schedulers has been validated. Managerial insights are provided with respect to the impact of key parameters.

show abstract

Section: Problem Definitionmentioning

confidence: 99%

Capital- and resource-constrained project scheduling with net present value optimization

Leyman

Vanhoucke

2017

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Finally, Neumann and Schwindt [10] study project scheduling problems with inventory constraints. They analyze the feasible region of job starting times, and propose to add temporary constraints between pairs of jobs to resolve resource conflicts in a branch-and-bound algorithm.…”

Section: Related Workmentioning

confidence: 99%

Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Drótos

Kis

2012

J Sched

View full text Add to dashboard Cite

In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al. We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points. Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times. We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion.

show abstract

“…However, for a related problem, where some of the jobs produce, while other jobs consume some non-renewable resources (and there are no replenishments from external sources) Briskorn et al (2013) propose an exact method for minimizing the total weighted completion time of the jobs. In the more general project scheduling setting, Neumann & Schwindt (2003) study the makespan minimization problem with inventory constraints, and describe a branch-and-bound method for solving it.…”

Section: Introductionmentioning

confidence: 99%

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut

Györgyi

Kis

2018

Computers & Industrial Engineering

View full text Add to dashboard Cite

Machine scheduling with raw material constraints has a great practical potential, as it is solved by ad-hoc methods in practice in several manufacturing and logistic environments. In this paper we propose an exact method for solving this problem with the maximum lateness objective based on mathematical programming, our main contribution being a set of new cutting planes that can be used to accelerate a MIP solver. We report on computational results on a wide set of instances.

show abstract

Project scheduling with inventory constraints

Cited by 85 publications

References 18 publications

Capital- and resource-constrained project scheduling with net present value optimization

Capital- and resource-constrained project scheduling with net present value optimization

Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut

Contact Info

Product

Resources

About