Discrete-continuous project scheduling with discounted cash flows-A tabu search approach

Authors:
Grzegorz Waligóra
Affiliations:
Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland
Venue:
Computers and Operations Research
Year:
2008

Citing 3
Cited 3

Resource-constrained project scheduling: a survey of recent developments

Computers and Operations Research
Tabu Search

Tabu Search
Multiprocessor Scheduling with Memory Allocation A Deterministic Approach

IEEE Transactions on Computers

A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations

Computers and Operations Research
Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan

Computational Optimization and Applications
Resource constrained project scheduling problem with discounted earliness-tardiness penalties: Mathematical modeling and solving procedure

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper discrete-continuous project scheduling problems with discounted cash flows are considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. The processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. Two common payment models-lump-sum payment and payments at activities' completion times-are considered. The objective is the maximization of the net present value of all cash flows of the project. Some properties of optimal schedules are discussed, and the formulation of a mathematical programming problem for an optimal continuous resource allocation is presented. Applications of a local search metaheuristic-tabu search, as well as simple search methods-multi-start iterative improvement and random sampling are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given.