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

Authors:
JóZsef BéKéSi;GáBor Galambos;Marcus Oswald;Gerhard Reinelt
Affiliations:
Department of Informatics, Faculty of Juhász Gyula Teacher's Training College, University of Szeged, Hungary;Department of Informatics, Faculty of Juhász Gyula Teacher's Training College, University of Szeged, Hungary;Institute of Informatics, University of Heidelberg, Germany;Institute of Informatics, University of Heidelberg, Germany
Venue:
Operations Research Letters
Year:
2009

Citing 3
Cited 2

On the complexity of coupled-task scheduling

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The coupled task problem is to schedule n jobs, each one consisting of two subtasks with exact delay times between them, on a single machine. We derive a new lower bound for the problem variant with unit execution times and correct a previously published analysis.