On the complexity of coupled-task scheduling
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
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
| Hi-index | 0.05 |
The coupled tasks problem consists in scheduling n jobs on a single machine. Each job i is made of two operations with processing times a"i and b"i and a fixed required delay L"i between them. Operations cannot overlap in time but operations of different jobs can be interleaved. The objective is to minimize the makespan of the schedule. In this note we show that the problem with identical jobs (@?i,a"i=a,b"i=b,L"i=L) can be solved in O(logn) time when a,b,L are fixed. This problem is motivated by radar scheduling applications where tasks corresponding to transmitting radiowaves and listening to potential echoes are coupled.