Open Access
RAIRO-Oper. Res.
Volume 57, Number 1, January-February 2023
Page(s) 1 - 16
Published online 12 January 2023
  • G. Ausiello and V. Paschos, Differential approximation (September 2005), Chapter 13 in Approximation Algorithms and Metaheuristics, edited by T. Gongalez. Taylor and Francis (2005). [Google Scholar]
  • A. Elalouf, An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels. RAIRO Oper. Res. 55 (2021) S727–S740. [CrossRef] [EDP Sciences] [Google Scholar]
  • A. Elalouf and E. Levner, Improving the solution complexity of the scheduling problem with deadlines: a general technique. RAIRO Oper. Res. 50 (2016) 681–687. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
  • A. Grange, I. Kacem and S. Martin, Algorithms for the bin packing problem with overlapping items. Comput. Ind. Eng. 115 (2018) 331–341. [CrossRef] [Google Scholar]
  • A. Grange, I. Kacem, K. Laurent and S. Martin, On the knapsack problem under merging objects’ constraints, in Proc. of 45th International Conference on Computers and Industrial Engineering 2015 (CIE45). Vol. 2. Metz, France, Curran Associates, Inc. (2018) 1359–1368. [Google Scholar]
  • A. Grange, I. Kacem, S. Martin and S. Minich, Fully polynomial-time approximation scheme for the pagination problem, in Proc. of 49th International Conference on Computers and Industrial Engineering 2019 (CIE49). Beijing, China (2019) 400. [Google Scholar]
  • I.T. Jolliffe, Principal component analysis for special types of data, in Principal Component Analysis. Springer Series in Statistics. Springer, New York, NY (1986). [CrossRef] [Google Scholar]
  • I. Kacem, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Comb. Optim. 17 (2009) 117–133. [CrossRef] [MathSciNet] [Google Scholar]
  • I. Kacem and H. Kellerer, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Sched. 14 (2011) 257–265. [CrossRef] [MathSciNet] [Google Scholar]
  • I. Kacem and E. Levner, An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs. J. Ind. Manage. Optim. 12 (2016) 811. [Google Scholar]
  • M. Kovalyov and E. Pesch, A generic approach to proving NP-hardness of partition type problems. Discrete Appl. Math. 158 (2010) 1908–1912. [CrossRef] [MathSciNet] [Google Scholar]
  • M. Rouaud, Probabilités, statistiques et analyses multicritères (2012). [Google Scholar]
  • J. Pagès, Analyse Factorielle Multiple Avec R. Vol. 158. EDP Sciences (2013) 1908–1912. [Google Scholar]
  • M. Sindelar, R.K. Sitaraman and P. Shenoy, Sharing-aware algorithms for virtual machine colocation, in Proc. of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures SPAA’11, San Jose, California, USA (2011) 367–378. [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.