Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

DOI10.1007/978-3-319-09174-7_14zbMath1451.90057OpenAlexW1000832950MaRDI QIDQ3195325

Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude Konig

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_14

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs ⋮ Parameterized complexity of a coupled-task scheduling problem

Cites Work

• Unnamed Item
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• A 3/4-approximation algorithm for multiple subset sum
• Approximation algorithms for the multiple knapsack problem with assignment restrictions
• A PTAS for the multiple subset sum problem with different knapsack capacities
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
• The Multiple Subset Sum Problem
• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
• Coupled-Tasks in Presence of Bipartite Compatibilities Graphs
• Scheduling coupled tasks
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Coupled-Tasks in Presence of Bipartite Compatibilities Graphs