Open Access
| Issue |
RAIRO-Oper. Res.
Volume 58, Number 3, May-June 2024
|
|
|---|---|---|
| Page(s) | 2393 - 2419 | |
| DOI | https://doi.org/10.1051/ro/2024029 | |
| Published online | 18 June 2024 | |
- G. Alhadi, I. Kacem, P. Laroche and I.M. Osman, Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. Ann. Oper. Res. 285 (2019) 369–395. [Google Scholar]
- N. Alon, Y. Azar, G.J. Woeginger and T. Yadid, Approximation schemes for scheduling on parallel machines. J. Sched. 1 (1998) 55–66. [CrossRef] [MathSciNet] [Google Scholar]
- E. Angel, E. Bampis and A. Kononov, A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In: European Symposium on Algorithms. Springer, Berlin, Heidelberg (2001) 194–205. [Google Scholar]
- D. Anghinolfi, M. Paolucci and R. Ronco, A bi-objective heuristic approach for green identical parallel machine scheduling. Eur. J. Oper. Res. 289 (2019) 416–434. [Google Scholar]
- L. Bradstreet, The Hypervolume Indicator for Multi-objective Optimisation: Calculation and Use. University of Western Australia (2011). [Google Scholar]
- Y.H. Chung and L.I. Tong, Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations. Int. J. Adv. Manuf. Technol. 56 (2011) 355–367. [CrossRef] [Google Scholar]
- A. Elalouf, An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels. RAIRO:RO 55 (2021) S727–S740. [CrossRef] [EDP Sciences] [Google Scholar]
- C.M. Fonseca, M. López-Ibáñez, L. Paquete and A.P. Guerreiro, Computation of the Hypervolume Indicator (2018). http://lopez-ibanez.eu/hypervolume. [Google Scholar]
- M. Garey, D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979). [Google Scholar]
- A. Grange, I. Kacem, S. Martin and S. Minich, Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. RAIRO:RO 57 (2023) 1–16. [CrossRef] [EDP Sciences] [Google Scholar]
- Y. He and Z. Tan, Ordinal on-line scheduling for maximizing the minimum machine completion time. J. Comb. Optim. 6 (2002) 199–206. [CrossRef] [MathSciNet] [Google Scholar]
- M. Heydari and A. Aazami, Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times. J. Ind. Syst. Eng. 11 (2018) 134–150. [Google Scholar]
- Y. Huo and H. Zhao, Bi-criteria scheduling on multiple machines subject to machine availability constraints. In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer, Berlin, Heidelberg (2013) 325–338. [Google Scholar]
- I. Kacem and H. Kellerer, Approximation algorithms for no-idle time scheduling on a single machine with release dates and delivery times. Discrete Appl. Math. 164 (2014) 154–160. [CrossRef] [MathSciNet] [Google Scholar]
- A. Kacem and A. Dammak, Multi-objective scheduling on two dedicated processors. Top 29 (2021) 694–721. [CrossRef] [MathSciNet] [Google Scholar]
- I. Kacem, M. Sahnoune and G. Schmidt, Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO:RO 51 (2017) 1177–1188. [CrossRef] [EDP Sciences] [Google Scholar]
- K. Lee, J.Y.T. Leung and M.L. Pinedo, Makespan minimization in online scheduling with machine eligibility. Ann. Oper. Res. 204 (2013) 189–222. [CrossRef] [MathSciNet] [Google Scholar]
- Y.K. Lin, J.W. Fowler and M.E. Pfund, Multiple-objective heuristics for scheduling unrelated parallel machines. Eur. J. Oper. Res. 227 (2013) 239–253. [CrossRef] [Google Scholar]
- B. Przybylski, Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times. J. Comb. Optim. 44 (2022) 207–222. [CrossRef] [MathSciNet] [Google Scholar]
- L.H. Su, Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints. Int. J. Adv. Manuf. Technol. 40 (2009) 572–581. [CrossRef] [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.