Title of article
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
Author/Authors
Simonin، نويسنده , , G. and Giroudeau، نويسنده , , R. and Kِnig، نويسنده , , J.-C.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
647
To page
654
Abstract
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 ( n log ( n ) ) polynomial-time algorithm for a specific coupled-tasks scheduling problem.
Keywords
Polynomial-time algorithm , Scheduling , Matching , coupled-tasks
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455480
Link To Document