Volume 46, Number 4, October-December 2012
|Page(s)||335 - 353|
|Published online||10 December 2012|
New algorithms for coupled tasks scheduling – a survey
1 Institute of Bioorganic Chemistry,
Polish Academy of Sciences, ul. Z.
Noskowskiego 12/14, 61-704
2 Institute of Computing Science, Poznan University of Technology, ul. Piotrowo 2, 60-965 Poznan, Poland
3 Computer Science Division, Physics Faculty, Adam Mickiewicz University, ul. Umultowska 85, 61-614 Poznan, Poland
Accepted: 12 October 2012
The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling is constantly growing. Unfortunately, most of the coupled tasks problems are NP-hard, and only a few practically usable algorithms for such problems were found. This paper provides a survey of already known complexity results of various variants of coupled tasks problems. Then, it complements previous results by providing experimental results of two new polynomial algorithms for coupled tasks scheduling, which are: an exact algorithm for 1|(1,4,1),strictchains|Cmax problem, and a fast heuristic algorithm for more general 1|(1,2k, 1), strictchains|Cmax problem, where k ∈ ℕ.
Mathematics Subject Classification: 9002 / 9008 / 90B30 / 90B35 / 90C27 / 90C59 / 90C60
Key words: Coupled tasks / scheduling / complexity theory / heuristic algorithms
© EDP Sciences, ROADEF, SMAI, 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.