On the complexity of coupled-task scheduling
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Interleaving two-phased jobs on a single machine
Discrete Optimization
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Minimizing total completion time in two-machine flow shops with exact delays
Computers and Operations Research
A 3/2-approximation for the proportionate two-machine flow shop scheduling with minimum delays
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Scheduling of coupled tasks with unit processing times
Journal of Scheduling
Coupled-task scheduling on a single machine subject to a fixed-job-sequence
Computers and Industrial Engineering
Complexity and approximation for scheduling problem for a torpedo
Computers and Industrial Engineering
Improved analysis of an algorithm for the coupled task problem with UET jobs
Operations Research Letters
Scheduling coupled-operation jobs with exact time-lags
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper we consider coupled-task single-machine and two-machine flow shop scheduling problems with exact delays, unit processing times, and the makespan as an objective function. The main results of the paper are fast 7/4- and 3/2-approximation algorithms for solving the single- and two-machine problems, respectively.