In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

This paper shows that a method that has long been used to solve Resource Constrained Optimization Problems and found extremely effective in practice, is effective in the theoretical sense as well, it is proved to be strongly polynomial. In the special case of Resource Constrained Shortest Path Problem a better running time estimation is also presented.

PREFACE After having received my diploma from the Technische Universität Berlin in 1996, Rolf Möhring, the supervisor of my diploma thesis, offered me a research position in his group. At that time I was employed at a Berlin software company the head of which, Gert Scheschonk, strongly encouraged me to accept the offer. I accepted and in 1997 I began to work within a research initiative funded ...

Security and privacy are very important challenges for outsourced private data over cloud storages. By taking Attribute-Based Encryption (ABE) for Access Control (AC) purpose we use fine-grained AC over cloud storage. In this paper, we extend previous Ciphertext Policy ABE (CP-ABE) schemes especially for mobile and resource-constrained devices in a cloud computing environment in two aspects, a ...

    Project scheduling   Net present value   We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a t...

The popularity of mobile and networked applications has resulted in an increased demand for execution “sandboxes”—environments that impose irrevocable restrictions on resource usage. Existing approaches rely on kernel modification for enforcing quantitative restrictions (e.g., limiting CPU utilization of an application to 25%). However, the general applicability of such approaches is constraine...

In this paper, we present a new topic in connection with project scheduling. Since a limited work space can form a restriction to project scheduling problems, an efficient usage of these work spaces (or so-called spatial resources) is required to produce good project schedules. The requirement for the resource units of these spatial resources is in an adjacent manner (we cannot place a product ...

We consider the following resource constrained scheduling problem. Given m iden-of unit length, where each job T j has a start time r j 2 II N, requires one processor and an amount R i (j) 2 f0; 1g of resource R i , i = 1; : : :; s. The optimization problem is to schedule the jobs at discrete times in II N subject to the processor, resource and start-time constraints so that the latest scheduli...