Open Access
| Issue |
RAIRO-Oper. Res.
Volume 56, Number 5, September-October 2022
|
|
|---|---|---|
| Page(s) | 3777 - 3788 | |
| DOI | https://doi.org/10.1051/ro/2022174 | |
| Published online | 01 November 2022 | |
- A. Ait El Cadi, R. Ben Atitallah, S. Hanafi, N. Mladenovic and A. Artiba, New MIP model for multiprocessor scheduling problem with communication delays. Optim. Lett. 11 (2017) 1091–1107. [CrossRef] [MathSciNet] [Google Scholar]
- H.L. Bodlaender, A tourist guide through treewidth. Acta Cybern. 11 (1992) 1–21. [Google Scholar]
- H.L. Bodlaender and M.R. Fellows, W[2]-hardness of precedence constrained k-processor scheduling. Oper. Res. Lett. 18 (1995) 93–97. [CrossRef] [MathSciNet] [Google Scholar]
- P. Chrétienne and C. Picouleau, Scheduling with communication delays: a survey, in Scheduling Theory and its Applications. John Wiley & Sons, New York (1995) 65–90. [Google Scholar]
- M. Cygan, F.V. Fomin, Ł. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk and S. Saurabh, Parameterized Algorithms, 1st edition. Springer Publishing Company, Incorporated (2015). [CrossRef] [Google Scholar]
- T. Davidović, L. Liberti, N. Maculan and N. Mladenovic, Towards the Optimal Solution of the Multiprocessor Scheduling Problem with Communication Delays. MISTA Conference (2007). [Google Scholar]
- M. de Weerdt, R. Baart and L. He, Single-machine scheduling with release times, deadlines, setup times, and rejection. Eur. J. Oper. Res. 291 (2021) 629–639. [CrossRef] [Google Scholar]
- R.G. Downey and M.R. Fellows, Fundamentals of Parameterized Complexity. Springer, London (2013). [CrossRef] [Google Scholar]
- M. Drozdowski, Scheduling for Parallel Processing. Springer (2009). [Google Scholar]
- J. Du, J.Y.-T. Leung and G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time. Inf. Comput. 92 (1991) 219–236. [CrossRef] [Google Scholar]
- R. Giroudeau and J.-C. Koenig, Scheduling with communication delays, in Multiprocessor Scheduling, edited by E. Levner. IntechOpen, Rijeka (2007). [Google Scholar]
- R.L. Graham, Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45 (1966) 1563–1581. [CrossRef] [Google Scholar]
- R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, in Discrete Optimization II. Annals of Discrete Mathematics, edited by P.L. Hammer, E.L. Johnson and B.H. Korte. Vol. 5, Elsevier (1979) 287–326. [Google Scholar]
- E. Günther, F.G. König and N. Megow, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. J. Comb. Optim. 27 (2014) 164–181. [CrossRef] [MathSciNet] [Google Scholar]
- H. Hoogeveen, J.K. Lenstra and B. Veltman, Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16 (1994) 129–137. [CrossRef] [MathSciNet] [Google Scholar]
- M. Mnich and R. Van Bevern, Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100 (2018) 254–261. [CrossRef] [MathSciNet] [Google Scholar]
- A. Munier Kordon, A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. Discrete Appl. Math. 290 (2021) 1–6. [CrossRef] [MathSciNet] [Google Scholar]
- V.J. Rayward-Smith, Uet scheduling with unit interprocessor communication delays. Discrete Appl. Math. 18 (1987) 55–71. [CrossRef] [MathSciNet] [Google Scholar]
- L. Schrage, Solving resource-constrained network problems by implicit enumeration – nonpreemptive case. Oper. Res. 18 (1970) 263–278. [CrossRef] [Google Scholar]
- J.P. Sousa and L.A. Wolsey, A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54 (1992) 353–367. [CrossRef] [Google Scholar]
- N. Tang and A.M. Kordon, A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays, in European Conference on Parallel Processing. Lecture Notes in Computer Science. Vol. 12820. Springer (2021) 105–119. [Google Scholar]
- R. van Bevern, R. Bredereck, L. Bulteau, C. Komusiewicz, N. Talmon and G.J. Woeginger, Precedence-constrained scheduling problems parameterized by partial order width, in International Conference on Discrete Optimization and Operations Research. Springer International Publishing (2016) 105–120. [CrossRef] [Google Scholar]
- B. Veltman, Multiprocessor scheduling with communication delays. Ph.D. thesis. Eindhoven University of Technology (1993). [Google Scholar]
- B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays. Parallel Comput. 16 (1990) 173–182. [CrossRef] [Google Scholar]
- S. Venugopalan and O. Sinnen, Ilp formulations for optimal task scheduling with communication delays on parallel systems. IEEE Trans. Parallel Distrib. Syst. 26 (2015) 142–151. [CrossRef] [Google Scholar]
- Y. Zinder, B. Su, G. Singh and R. Sorli, Scheduling uet-uct tasks: Branch-and-bound search in the priority space. Optim. Eng. 11 (2010) 627–646. [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.