Showing 1 - 10 of 16
Resource loading appears in many variants in tactical (mid-term) capacity planning in multi-project environments. It develops a rough sketch of the resource usage and timing of the work packages of a portfolio of orders. The orders need to be executed within a time horizon organized into...
Persistent link: https://www.econbiz.de/10011209304
This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign. We show that the problem is strongly NP-hard and that it is unlikely that a constant-factor approximation algorithm can be proposed for...
Persistent link: https://www.econbiz.de/10008865067
Persistent link: https://www.econbiz.de/10010826329
Persistent link: https://www.econbiz.de/10011011424
We prove that the problem of testing whether data of consumption expenditures satisfy the Collective Axiom of Revealed Preference (CARP) is an NP-complete problem.
Persistent link: https://www.econbiz.de/10008869066
In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively...
Persistent link: https://www.econbiz.de/10004983122
We survey several viewpoints on the management of the planning complexity of multi-project organisations under uncertainty. Based on these viewpoints we propose a positioning framework to distinguish between different types of project-driven organisations. This framework is meant to aid project...
Persistent link: https://www.econbiz.de/10005336230
The goal of this article is to survey the relevant literature on project scheduling with possible activity failures from a number of different disciplines, and to distill from these sources the formulation of a general optimization problem, the further study of which we would like to foster...
Persistent link: https://www.econbiz.de/10008684372
In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively...
Persistent link: https://www.econbiz.de/10005464831
We investigate project scheduling with stochastic activity durations to maximize the expected net present value. Individual activities also carry a risk of failure, which can cause the overall project to fail. In the project planning literature, such technological uncertainty is typically...
Persistent link: https://www.econbiz.de/10011190792