Scheduling a sequence of tasks with general completion costs

Francis Sourd 1
1 SYSDEF - Systèmes d'aide à la décision et à la formation
LIP6 - Laboratoire d'Informatique de Paris 6
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 in 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 to exceed a maximum fixed cost.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01561983
Contributor : Lip6 Publications <>
Submitted on : Thursday, July 13, 2017 - 2:15:25 PM
Last modification on : Thursday, March 21, 2019 - 1:04:50 PM

Identifiers

  • HAL Id : hal-01561983, version 1

Citation

Francis Sourd. Scheduling a sequence of tasks with general completion costs. CO 2002 - 12th International Symposium on Combinatorial Optimization, Apr 2002, Paris, France. CO 2002 - 12th International Symposium on Combinatorial Optimization, pp.127-127. 〈hal-01561983〉

Share

Metrics

Record views

48