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
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
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
Interleaving two-phased jobs on a single machine
Discrete Optimization
| Hi-index | 0.02 |
This paper considers a special case of the coupled-tasks scheduling problem on monoprocessor. The general problems were analyzed in depth by Orman and Potts (1997). In this paper, we consider that all processing times are equal to 1, the gap has exact length L, we have precedence constraints, incompatibility constraints are introduced and the criterion is to minimize the scheduling length. We use this problem to study the problem of data acquisition and data treatment of a torpedo under the water. We show that this problem is NP-complete and we propose an @r-approximation algorithm where @r=