Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

DOI10.1016/J.ENDM.2010.05.082zbMath1237.90098OpenAlexW1996979574MaRDI QIDQ2883631

Rodolphe Giroudeau, Gilles Simonin, Jean-Claude Konig

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00522986/file/ISCO_Simonin.pdf

zbMATH Keywords

schedulingmatchingpolynomial-time algorithmcoupled-tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs ⋮ The coupled unit-time operations problem on identical parallel machines with respect to the makespan ⋮ Some complexity and approximation results for coupled-tasks scheduling problem according to topology ⋮ Two-machine flowshop scheduling problem with coupled-operations

Cites Work

• Scheduling of coupled tasks with unit processing times
• An exact algorithm for scheduling identical coupled tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the complexity of coupled-task scheduling

This page was built for publication: Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks