Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Complexity of scheduling tasks with processing time dependent profit

Florian Fontan 1 Pierre Lemaire 1 Nadia Brauner 1 
1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : In this paper, we introduce and study scheduling problems, where tasks yield a processing time dependent profit. In these problems, the processing time of a task is not given as input but must be decided; the profit from a task then depends on its allocated processing time and the objective is to maximize the total profit. These problems originate from astrophysics. First, we state formally the problem and propose several profit functions, including non-continuous and non-concave ones. Next, we prove and discuss some generic properties on the structure of solutions. Then, we study the complexity of the main models, proving the NP-completeness of some, and proposing polynomial algorithms for others.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Florian Fontan Connect in order to contact the contributor
Submitted on : Friday, December 7, 2018 - 11:28:46 AM
Last modification on : Tuesday, March 8, 2022 - 5:28:02 PM
Long-term archiving on: : Friday, March 8, 2019 - 2:07:48 PM


Files produced by the author(s)


  • HAL Id : hal-01947847, version 1



Florian Fontan, Pierre Lemaire, Nadia Brauner. Complexity of scheduling tasks with processing time dependent profit. 2018. ⟨hal-01947847⟩



Record views


Files downloads