Affordable Access

Publisher Website

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

Authors
Journal
Electronic Notes in Discrete Mathematics
1571-0653
Publisher
Elsevier
Publication Date
Volume
36
Identifiers
DOI: 10.1016/j.endm.2010.05.082
Keywords
  • Polynomial-Time Algorithm
  • Scheduling
  • Coupled-Tasks
  • Matching
Disciplines
  • Computer Science

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.