Open Access
| Issue |
RAIRO-Oper. Res.
Volume 57, Number 2, March-April 2023
|
|
|---|---|---|
| Page(s) | 325 - 332 | |
| DOI | https://doi.org/10.1051/ro/2023014 | |
| Published online | 15 March 2023 | |
- D. Ahr, J. Bekesi, G. Galambos, M. Oswald and G. Reinelt, An exact algorithm for scheduling identical coupled tasks. Math. Methods Oper. Res. 59 (2004) 193–203. [CrossRef] [MathSciNet] [Google Scholar]
- P. Baptiste, A note on scheduling coupled tasks in logarithmic time. Discrete Appl. Math. 158 (2010) 583–587. [CrossRef] [MathSciNet] [Google Scholar]
- J. Blazewicz, G. Pawlak, M. Tanas and W. Wojciechowicz, New algorithms for coupled tasks scheduling – a survey. RAIRO: Oper. Res. 46 (2012) 335–353. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
- N. Brauner, G. Finke, V. Lehoux-Lebacque, C. Potts and J. Whitehead, Scheduling of coupled tasks and one-machine no-wait robotic cells. Comput. Oper. Res. 36 (2009) 301–307. [CrossRef] [MathSciNet] [Google Scholar]
- B. Darties, R. Giroudeau, J.C. Konig and G. Simonin, Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO: Oper. Res. 50 (2016) 781–795. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
- V. Lehoux-Lebacque, N. Brauner and G. Finke, Identical coupled task scheduling: polynomial complexity of the cyclic case. J. Scheduling 18 (2015) 631–644. [CrossRef] [MathSciNet] [Google Scholar]
- A.J. Orman and C.N. Potts, On the complexity of coupled-task scheduling. Discrete Appl. Math. 72 (1997) 141–154. [CrossRef] [MathSciNet] [Google Scholar]
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.