Optimal timing of a sequence of tasks with general completion costs - Archive ouverte HAL
Article Dans Une Revue European Journal of Operational Research Année : 2005

Optimal timing of a sequence of tasks with general completion costs

Francis Sourd
  • Fonction : Auteur
  • PersonId : 836436

Résumé

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.

Dates et versions

hal-01185224 , version 1 (19-08-2015)

Identifiants

Citer

Francis Sourd. Optimal timing of a sequence of tasks with general completion costs. European Journal of Operational Research, 2005, 165 (1), pp.82-96. ⟨10.1016/j.ejor.2004.01.025⟩. ⟨hal-01185224⟩
66 Consultations
0 Téléchargements

Altmetric

Partager

More