An exact algorithm for scheduling identical coupled tasks

DOI10.1007/s001860300328zbMath1138.90390OpenAlexW2091078967MaRDI QIDQ1762669

Gábor Galambos, József Békési, Gerhard Reinelt, Marcus Oswald, Dino Ahr

Publication date: 11 February 2005

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860300328

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks, The coupled unit-time operations problem on identical parallel machines with respect to the makespan, Scheduling of coupled tasks with unit processing times, Some complexity and approximation results for coupled-tasks scheduling problem according to topology, A branch-and-bound algorithm for the coupled task problem, Identical coupled task scheduling: polynomial complexity of the cyclic case, Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor, Scheduling of coupled tasks and one-machine no-wait robotic cells, A note on scheduling identical coupled tasks in logarithmic time, Scheduling coupled-operation jobs with exact time-lags, Coupled task scheduling with exact delays: literature review and models, Two machines flow shop with reentrance and exact time lag, Improved analysis of an algorithm for the coupled task problem with UET jobs, A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays, Scheduling coupled tasks with exact delays for minimum total job completion time, Coupled task scheduling with time-dependent processing times, Two-machine flowshop scheduling problem with coupled-operations