A branch-and-bound algorithm for the coupled task problem

DOI10.1007/s00186-014-0469-6zbMath1302.90132OpenAlexW1980759864MaRDI QIDQ406642

Gábor Galambos, Michael N. Jung, József Békési, Marcus Oswald, Gerhard Reinelt

Publication date: 8 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00186-014-0469-6

zbMATH Keywords

integer programmingbranch-and-boundcoupled task problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

A binary search algorithm for the general coupled task scheduling problem, The coupled task scheduling problem: an improved mathematical program and a new solution algorithm, Coupled task scheduling with exact delays: literature review and models, Coupled task scheduling with time-dependent processing times

Cites Work

• Interleaving two-phased jobs on a single machine
• Scheduling for a multifunction phased array radar system
• An exact algorithm for scheduling identical coupled tasks
• Approximation algorithms for UET scheduling problems with exact delays
• Heuristics for a coupled-operation scheduling problem
• Radar pulse interleaving for multi‐target tracking
• On the complexity of coupled-task scheduling