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

DOI10.1007/S00186-014-0469-6zbMATH Open1302.90132OpenAlexW1980759864MaRDI QIDQ406642FDOQ406642

Authors: József Békési, Gábor Galambos, Michael Jung, 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

Recommendations

• A branch-and-bound algorithm for the singly constrained assignment problem
• A binary search algorithm for the general coupled task scheduling problem
• Branch and bound algorithms for the multidimensional assignment problem
• Parameterized complexity of a coupled-task scheduling problem
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
• On the complexity of coupled-task scheduling
• A branch and bound algorithm for the job-shop scheduling problem
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times
• scientific article; zbMATH DE number 2087412
• A branch-and-bound algorithm for one class of scheduling problem

zbMATH Keywords

integer programmingbranch-and-boundcoupled task problem

Mathematics Subject Classification ID

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

Cites Work

• Heuristics for a coupled-operation scheduling problem
• 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
• Radar pulse interleaving for multi‐target tracking
• On the complexity of coupled-task scheduling

Cited In (5)

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

This page was built for publication: A branch-and-bound algorithm for the coupled task problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406642)