Scheduling of coupled tasks with unit processing times

Authors:
J. Blazewicz;K. Ecker;T. Kis;C. N. Potts;M. Tanas;J. Whitehead
Affiliations:
Poznan University of Technology, Poznan, Poland;Ohio University, Athens, USA;Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary;University of Southampton, Southampton, UK;Physics Faculty, Adam Mickiewicz University, Poznan, Poland 61-614;University of Southampton, Southampton, UK
Venue:
Journal of Scheduling
Year:
2010

Citing 7
Cited 2

On the complexity of coupled-task scheduling

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Modelling for the control of a complex radar system

Computers and Operations Research
Complexity results for single-machine problems with positive finish-start time-lags

Computing - Special issue on combinatorial optimization
Scheduling Algorithms

Scheduling Algorithms
Scheduling of coupled tasks and one-machine no-wait robotic cells

Computers and Operations Research
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters
Improved analysis of an algorithm for the coupled task problem with UET jobs

Operations Research Letters

Coupled-task scheduling on a single machine subject to a fixed-job-sequence

Computers and Industrial Engineering
Scheduling coupled-operation jobs with exact time-lags

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The coupled tasks scheduling problem was originally introduced for modeling complex radar devices. It is still used for controlling such devices and applied in similar applications. This paper considers a problem of coupled tasks scheduling on a single processor, under the assumptions that all processing times are equal to 1, the gap has exact integer length L and the precedence constraints are strict. We prove that the general problem, when L is part of the input and the precedence constraints graph is a general graph, is NP-hard in the strong sense. We also show that the special case when L=2 and the precedence constraints graph is an in-tree or an out-tree, can be solved in O(n) time.