New algorithms for coupled tasks scheduling – a survey

• Published in: R.A.I.R.O. Recherche opérationnelle Vol. 46; no. 4; pp. 335 - 353
• Main Authors: Blazewicz, Jacek, Pawlak, Grzegorz, Tanas, Michal, Wojciechowicz, Wojciech
• Format: Journal Article
• Language: English
• Published: Les Ulis EDP Sciences 01.10.2012
• Subjects: 9002; 9008; 90B30; 90B35; 90C27; 90C59; 90C60; Applied sciences; complexity theory; Coupled tasks; Exact sciences and technology; Flows in networks. Combinatorial problems; heuristic algorithms; Mathematical programming; Operational research and scientific management; Operational research. Management science; scheduling; Scheduling, sequencing; complexity theory; 9002; heuristic algorithms; 9008; Task scheduling; Scheduling; 90C59; 90C27; Combinatorial optimization; Computational complexity; Beam steering; 90B30; Heuristic method; NP hard problem; Radar; 90B35; Coupled tasks; Coupling; Fast algorithm; 90C60; Mathematical programming
• ISSN: 0399-0559; 1290-3868; 1290-3868
• DOI: 10.1051/ro/2012020

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 ∈ ℕ.