Volume 57, Number 2, March-April 2023
|Page(s)||325 - 332|
|Published online||15 March 2023|
New characterizations for the identical coupled tasks scheduling problem
Université de Tunis El Manar, Ecole Nationale d’Ingénieurs de Tunis, Oasis, BP. 37, Le belvédère 1002, Tunis, Tunisia
* Corresponding author: firstname.lastname@example.org; email@example.com
Accepted: 3 February 2023
In this note we introduce new characterizations for the optimal solution of the identical coupled tasks scheduling problem. We also develop three lower bounds and formulate useful observations about the choice of the test instances.
Mathematics Subject Classification: 90B35 / 90B30
Key words: Identical coupled tasks / lower bound / scheduling
© The authors. Published by EDP Sciences, ROADEF, SMAI 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.