New characterizations for the identical coupled tasks scheduling problem

DOI10.1051/RO/2023014zbMATH Open1515.90051MaRDI QIDQ6041202FDOQ6041202

Author name not available (Why is that?), Hatem Hadda

Publication date: 26 May 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

zbMATH Keywords

lower boundschedulingidentical coupled tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• An exact algorithm for scheduling identical coupled tasks

   Recommendations

• An exact algorithm for scheduling identical coupled tasks 👍 👎
• A note on scheduling identical coupled tasks in logarithmic time 👍 👎
• Identical coupled task scheduling: polynomial complexity of the cyclic case 👍 👎
• Improved analysis of an algorithm for the coupled task problem with UET jobs 👍 👎
• Scheduling of coupled tasks and one-machine no-wait robotic cells 👍 👎

This page was built for publication: New characterizations for the identical coupled tasks scheduling problem

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