Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks
Résumé
We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O(nlog(n)) polynomial-time algorithm for a large class of coupled-tasks scheduling problem.
Domaines
Recherche opérationnelle [math.OC]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...