Optimal timing of a sequence of tasks with general completion costs

Optimal timing of a sequence of tasks with general completion costs

0.00 Avg rating0 Votes
Article ID: iaor20061689
Country: Netherlands
Volume: 165
Issue: 1
Start Page Number: 82
End Page Number: 96
Publication Date: Aug 2005
Journal: European Journal of Operational Research
Authors:
Keywords: programming: dynamic
Abstract:

Scheduling a sequence of tasks – in the acceptation of finding the execution times – is not a trivial problem when the optimization criterion is irregular as for instance in earliness–tardiness problems. This paper presents an efficient dynamic programming algorithm to solve the problem with general cost functions depending on the end time of the tasks, idle time costs and variable durations also depending on the execution time of the tasks. The algorithm is also valid when the precedence graph is a tree and it can be adapted to determine the possible execution windows for each task not exceeding a maximum fixed cost.

Reviews

Required fields are marked *. Your email address will not be published.